./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:50:41,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:50:41,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:50:41,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:50:41,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:50:41,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:50:41,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:50:41,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:50:41,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:50:41,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:50:41,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:50:41,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:50:41,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:50:41,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:50:41,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:50:41,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:50:41,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:50:41,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:50:41,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:50:41,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:50:41,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:50:41,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:50:41,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:50:41,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:50:41,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:50:41,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:50:41,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:50:41,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:50:41,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:50:41,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:50:41,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:50:41,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:50:41,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:50:41,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:50:41,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:50:41,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:50:41,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:50:41,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:50:41,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:50:41,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:50:41,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:50:41,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:50:41,199 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:50:41,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:50:41,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:50:41,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:50:41,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:50:41,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:50:41,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:50:41,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:50:41,202 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:50:41,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:50:41,203 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:50:41,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:50:41,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:50:41,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:50:41,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:50:41,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:50:41,204 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:50:41,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:50:41,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:50:41,204 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:50:41,204 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:50:41,205 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:50:41,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:50:41,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:50:41,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:50:41,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:41,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:50:41,206 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:50:41,207 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:50:41,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:50:41,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:50:41,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:50:41,487 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:50:41,487 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:50:41,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:42,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:50:42,654 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:50:42,655 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:42,662 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b860ef1/ee81fc78e4c34799807c529080ebdd53/FLAG0e026fcce [2023-08-29 20:50:42,671 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b860ef1/ee81fc78e4c34799807c529080ebdd53 [2023-08-29 20:50:42,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:50:42,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:50:42,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:42,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:50:42,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:50:42,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:42" (1/1) ... [2023-08-29 20:50:42,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fec61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:42, skipping insertion in model container [2023-08-29 20:50:42,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:42" (1/1) ... [2023-08-29 20:50:42,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:50:42,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:50:42,834 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:50:43,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:43,015 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:50:43,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:50:43,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:43,100 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:43,101 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:43,105 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:50:43,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43 WrapperNode [2023-08-29 20:50:43,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:43,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:43,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:50:43,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:50:43,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,151 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-29 20:50:43,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:43,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:50:43,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:50:43,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:50:43,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:50:43,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:50:43,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:50:43,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:50:43,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:50:43,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:50:43,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:50:43,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:50:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:50:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:50:43,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:50:43,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:50:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:50:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:50:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:50:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:50:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:50:43,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:50:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:50:43,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:50:43,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:50:43,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:50:43,240 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:50:43,341 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:50:43,342 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:50:43,591 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:50:43,752 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:50:43,752 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:50:43,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:43 BoogieIcfgContainer [2023-08-29 20:50:43,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:50:43,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:50:43,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:50:43,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:50:43,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:50:42" (1/3) ... [2023-08-29 20:50:43,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb8bf06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:43, skipping insertion in model container [2023-08-29 20:50:43,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (2/3) ... [2023-08-29 20:50:43,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb8bf06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:43, skipping insertion in model container [2023-08-29 20:50:43,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:43" (3/3) ... [2023-08-29 20:50:43,758 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:50:43,768 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:50:43,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:50:43,768 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:50:43,819 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:50:43,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-08-29 20:50:43,889 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-29 20:50:43,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:43,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:50:43,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-08-29 20:50:43,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-08-29 20:50:43,898 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:50:43,904 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-29 20:50:43,905 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-08-29 20:50:43,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-08-29 20:50:43,940 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-08-29 20:50:43,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:43,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:50:43,942 INFO L119 LiptonReduction]: Number of co-enabled transitions 1978 [2023-08-29 20:50:47,864 INFO L134 LiptonReduction]: Checked pairs total: 4917 [2023-08-29 20:50:47,864 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-29 20:50:47,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:50:47,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;@6c28e691, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:50:47,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:50:47,879 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:50:47,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:47,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:47,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:50:47,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:47,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash 494, now seen corresponding path program 1 times [2023-08-29 20:50:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:47,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316900434] [2023-08-29 20:50:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:47,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316900434] [2023-08-29 20:50:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316900434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:47,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:50:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749946593] [2023-08-29 20:50:47,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:47,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:50:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:47,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:50:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:50:47,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 222 [2023-08-29 20:50:47,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:47,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:47,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 222 [2023-08-29 20:50:47,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:48,162 INFO L130 PetriNetUnfolder]: 777/1182 cut-off events. [2023-08-29 20:50:48,162 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:50:48,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1182 events. 777/1182 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5442 event pairs, 777 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 2376. Up to 1169 conditions per place. [2023-08-29 20:50:48,171 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-29 20:50:48,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 95 flow [2023-08-29 20:50:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:50:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:50:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 232 transitions. [2023-08-29 20:50:48,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2023-08-29 20:50:48,183 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 232 transitions. [2023-08-29 20:50:48,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 232 transitions. [2023-08-29 20:50:48,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:48,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 232 transitions. [2023-08-29 20:50:48,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,193 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,194 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 232 transitions. [2023-08-29 20:50:48,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 95 flow [2023-08-29 20:50:48,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:48,197 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-29 20:50:48,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-29 20:50:48,201 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-29 20:50:48,201 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-29 20:50:48,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:48,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:48,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:50:48,203 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:48,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 593760589, now seen corresponding path program 1 times [2023-08-29 20:50:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642655376] [2023-08-29 20:50:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:48,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642655376] [2023-08-29 20:50:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642655376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:48,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:50:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002117959] [2023-08-29 20:50:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:48,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:50:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:50:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:50:48,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2023-08-29 20:50:48,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:48,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2023-08-29 20:50:48,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:48,599 INFO L130 PetriNetUnfolder]: 615/1011 cut-off events. [2023-08-29 20:50:48,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1011 events. 615/1011 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5059 event pairs, 129 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1977. Up to 703 conditions per place. [2023-08-29 20:50:48,603 INFO L137 encePairwiseOnDemand]: 219/222 looper letters, 25 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-29 20:50:48,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 128 flow [2023-08-29 20:50:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:50:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:50:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-29 20:50:48,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2023-08-29 20:50:48,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-29 20:50:48,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-29 20:50:48,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:48,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-29 20:50:48,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,608 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 336 transitions. [2023-08-29 20:50:48,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 128 flow [2023-08-29 20:50:48,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:48,609 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-29 20:50:48,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-29 20:50:48,610 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-29 20:50:48,610 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-29 20:50:48,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:48,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:48,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:50:48,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:48,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -626671816, now seen corresponding path program 1 times [2023-08-29 20:50:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354836116] [2023-08-29 20:50:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:48,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354836116] [2023-08-29 20:50:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354836116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:49,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:49,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:49,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207768351] [2023-08-29 20:50:49,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:49,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:49,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-29 20:50:49,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:49,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-29 20:50:49,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:49,671 INFO L130 PetriNetUnfolder]: 1277/2042 cut-off events. [2023-08-29 20:50:49,671 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2023-08-29 20:50:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4171 conditions, 2042 events. 1277/2042 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10742 event pairs, 117 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 4167. Up to 1209 conditions per place. [2023-08-29 20:50:49,678 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 37 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2023-08-29 20:50:49,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 218 flow [2023-08-29 20:50:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-29 20:50:49,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2023-08-29 20:50:49,681 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-29 20:50:49,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-29 20:50:49,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:49,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-29 20:50:49,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,685 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,685 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 4 states and 423 transitions. [2023-08-29 20:50:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 218 flow [2023-08-29 20:50:49,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 50 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:49,687 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 140 flow [2023-08-29 20:50:49,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-08-29 20:50:49,688 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2023-08-29 20:50:49,690 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 140 flow [2023-08-29 20:50:49,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:49,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:49,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:50:49,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:49,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -626671794, now seen corresponding path program 1 times [2023-08-29 20:50:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419731061] [2023-08-29 20:50:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419731061] [2023-08-29 20:50:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419731061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527902741] [2023-08-29 20:50:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:50,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 222 [2023-08-29 20:50:50,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:50,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 222 [2023-08-29 20:50:50,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:50,241 INFO L130 PetriNetUnfolder]: 833/1308 cut-off events. [2023-08-29 20:50:50,242 INFO L131 PetriNetUnfolder]: For 980/1006 co-relation queries the response was YES. [2023-08-29 20:50:50,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1308 events. 833/1308 cut-off events. For 980/1006 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6277 event pairs, 332 based on Foata normal form. 121/1391 useless extension candidates. Maximal degree in co-relation 3817. Up to 1173 conditions per place. [2023-08-29 20:50:50,247 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 30 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-29 20:50:50,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 232 flow [2023-08-29 20:50:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2023-08-29 20:50:50,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4189189189189189 [2023-08-29 20:50:50,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2023-08-29 20:50:50,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2023-08-29 20:50:50,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:50,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2023-08-29 20:50:50,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,252 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 140 flow. Second operand 5 states and 465 transitions. [2023-08-29 20:50:50,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 232 flow [2023-08-29 20:50:50,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:50,254 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 136 flow [2023-08-29 20:50:50,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-29 20:50:50,255 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-29 20:50:50,255 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 136 flow [2023-08-29 20:50:50,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:50,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:50,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:50:50,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:50,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash 552320705, now seen corresponding path program 1 times [2023-08-29 20:50:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:50,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026713049] [2023-08-29 20:50:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026713049] [2023-08-29 20:50:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026713049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:50,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:50,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063868892] [2023-08-29 20:50:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:50,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:50,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:50,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:50,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-29 20:50:50,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:50,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-29 20:50:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:50,972 INFO L130 PetriNetUnfolder]: 956/1515 cut-off events. [2023-08-29 20:50:50,972 INFO L131 PetriNetUnfolder]: For 814/817 co-relation queries the response was YES. [2023-08-29 20:50:50,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4463 conditions, 1515 events. 956/1515 cut-off events. For 814/817 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7315 event pairs, 136 based on Foata normal form. 6/1520 useless extension candidates. Maximal degree in co-relation 4456. Up to 995 conditions per place. [2023-08-29 20:50:50,980 INFO L137 encePairwiseOnDemand]: 212/222 looper letters, 38 selfloop transitions, 18 changer transitions 0/57 dead transitions. [2023-08-29 20:50:50,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 352 flow [2023-08-29 20:50:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2023-08-29 20:50:50,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2023-08-29 20:50:50,981 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2023-08-29 20:50:50,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2023-08-29 20:50:50,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:50,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2023-08-29 20:50:50,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,984 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,985 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 136 flow. Second operand 4 states and 420 transitions. [2023-08-29 20:50:50,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 352 flow [2023-08-29 20:50:50,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 341 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:50,987 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 259 flow [2023-08-29 20:50:50,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-08-29 20:50:50,987 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-29 20:50:50,988 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 259 flow [2023-08-29 20:50:50,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:50,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:50:50,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:50,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -937863325, now seen corresponding path program 1 times [2023-08-29 20:50:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255595474] [2023-08-29 20:50:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255595474] [2023-08-29 20:50:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255595474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239264925] [2023-08-29 20:50:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:51,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:51,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-29 20:50:51,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:51,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-29 20:50:51,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:51,663 INFO L130 PetriNetUnfolder]: 1128/1813 cut-off events. [2023-08-29 20:50:51,663 INFO L131 PetriNetUnfolder]: For 2704/2704 co-relation queries the response was YES. [2023-08-29 20:50:51,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6527 conditions, 1813 events. 1128/1813 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9232 event pairs, 287 based on Foata normal form. 40/1853 useless extension candidates. Maximal degree in co-relation 6518. Up to 878 conditions per place. [2023-08-29 20:50:51,671 INFO L137 encePairwiseOnDemand]: 212/222 looper letters, 42 selfloop transitions, 23 changer transitions 0/66 dead transitions. [2023-08-29 20:50:51,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 515 flow [2023-08-29 20:50:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2023-08-29 20:50:51,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2023-08-29 20:50:51,673 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2023-08-29 20:50:51,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2023-08-29 20:50:51,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:51,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2023-08-29 20:50:51,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,676 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,676 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 259 flow. Second operand 4 states and 420 transitions. [2023-08-29 20:50:51,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 515 flow [2023-08-29 20:50:51,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 513 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:51,682 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 433 flow [2023-08-29 20:50:51,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2023-08-29 20:50:51,684 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-08-29 20:50:51,684 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 433 flow [2023-08-29 20:50:51,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:51,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:51,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:50:51,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:51,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash -937808548, now seen corresponding path program 1 times [2023-08-29 20:50:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:51,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605344659] [2023-08-29 20:50:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:51,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:51,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605344659] [2023-08-29 20:50:51,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605344659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:51,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:51,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271198151] [2023-08-29 20:50:51,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:51,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:51,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-29 20:50:51,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 433 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:51,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-29 20:50:51,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:52,169 INFO L130 PetriNetUnfolder]: 1297/2105 cut-off events. [2023-08-29 20:50:52,169 INFO L131 PetriNetUnfolder]: For 5200/5208 co-relation queries the response was YES. [2023-08-29 20:50:52,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8728 conditions, 2105 events. 1297/2105 cut-off events. For 5200/5208 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10832 event pairs, 207 based on Foata normal form. 11/2096 useless extension candidates. Maximal degree in co-relation 8716. Up to 1745 conditions per place. [2023-08-29 20:50:52,178 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 49 selfloop transitions, 10 changer transitions 2/71 dead transitions. [2023-08-29 20:50:52,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 719 flow [2023-08-29 20:50:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-08-29 20:50:52,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49211711711711714 [2023-08-29 20:50:52,180 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-08-29 20:50:52,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-08-29 20:50:52,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:52,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-08-29 20:50:52,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,182 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,182 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 433 flow. Second operand 4 states and 437 transitions. [2023-08-29 20:50:52,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 719 flow [2023-08-29 20:50:52,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 688 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:52,190 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 514 flow [2023-08-29 20:50:52,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2023-08-29 20:50:52,191 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-29 20:50:52,191 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 514 flow [2023-08-29 20:50:52,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:52,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:50:52,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:52,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -500045738, now seen corresponding path program 1 times [2023-08-29 20:50:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197267641] [2023-08-29 20:50:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197267641] [2023-08-29 20:50:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197267641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:52,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569995497] [2023-08-29 20:50:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:52,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:52,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 222 [2023-08-29 20:50:52,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 514 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:52,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 222 [2023-08-29 20:50:52,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:52,774 INFO L130 PetriNetUnfolder]: 1456/2275 cut-off events. [2023-08-29 20:50:52,774 INFO L131 PetriNetUnfolder]: For 6095/6095 co-relation queries the response was YES. [2023-08-29 20:50:52,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9972 conditions, 2275 events. 1456/2275 cut-off events. For 6095/6095 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10849 event pairs, 135 based on Foata normal form. 9/2284 useless extension candidates. Maximal degree in co-relation 9957. Up to 1865 conditions per place. [2023-08-29 20:50:52,783 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 64 selfloop transitions, 15 changer transitions 7/86 dead transitions. [2023-08-29 20:50:52,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 913 flow [2023-08-29 20:50:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2023-08-29 20:50:52,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720720720720721 [2023-08-29 20:50:52,785 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2023-08-29 20:50:52,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2023-08-29 20:50:52,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:52,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2023-08-29 20:50:52,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,788 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,788 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 514 flow. Second operand 5 states and 524 transitions. [2023-08-29 20:50:52,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 913 flow [2023-08-29 20:50:52,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 907 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:52,796 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 616 flow [2023-08-29 20:50:52,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2023-08-29 20:50:52,799 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2023-08-29 20:50:52,799 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 616 flow [2023-08-29 20:50:52,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:52,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:52,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:50:52,799 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:52,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash 992705132, now seen corresponding path program 1 times [2023-08-29 20:50:52,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:52,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425313113] [2023-08-29 20:50:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425313113] [2023-08-29 20:50:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425313113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457539542] [2023-08-29 20:50:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:53,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:53,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:53,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-29 20:50:53,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 616 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:53,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-29 20:50:53,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:53,334 INFO L130 PetriNetUnfolder]: 1220/2009 cut-off events. [2023-08-29 20:50:53,334 INFO L131 PetriNetUnfolder]: For 7523/7533 co-relation queries the response was YES. [2023-08-29 20:50:53,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9447 conditions, 2009 events. 1220/2009 cut-off events. For 7523/7533 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10453 event pairs, 231 based on Foata normal form. 16/1995 useless extension candidates. Maximal degree in co-relation 9428. Up to 1608 conditions per place. [2023-08-29 20:50:53,345 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 59 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2023-08-29 20:50:53,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 1001 flow [2023-08-29 20:50:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:50:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:50:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-29 20:50:53,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2023-08-29 20:50:53,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-29 20:50:53,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-29 20:50:53,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:53,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-29 20:50:53,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,350 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 616 flow. Second operand 4 states and 435 transitions. [2023-08-29 20:50:53,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 1001 flow [2023-08-29 20:50:53,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:53,359 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 745 flow [2023-08-29 20:50:53,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=745, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-08-29 20:50:53,359 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-08-29 20:50:53,360 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 745 flow [2023-08-29 20:50:53,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:53,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:53,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:50:53,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:53,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:53,361 INFO L85 PathProgramCache]: Analyzing trace with hash -499990000, now seen corresponding path program 2 times [2023-08-29 20:50:53,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:53,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911193599] [2023-08-29 20:50:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:53,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911193599] [2023-08-29 20:50:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911193599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35058521] [2023-08-29 20:50:53,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:53,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:53,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:53,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:53,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-29 20:50:53,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 745 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:53,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-29 20:50:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:53,955 INFO L130 PetriNetUnfolder]: 1316/2133 cut-off events. [2023-08-29 20:50:53,956 INFO L131 PetriNetUnfolder]: For 9671/9746 co-relation queries the response was YES. [2023-08-29 20:50:53,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10878 conditions, 2133 events. 1316/2133 cut-off events. For 9671/9746 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11113 event pairs, 218 based on Foata normal form. 85/2178 useless extension candidates. Maximal degree in co-relation 10858. Up to 1486 conditions per place. [2023-08-29 20:50:53,971 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 74 selfloop transitions, 31 changer transitions 2/118 dead transitions. [2023-08-29 20:50:53,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 118 transitions, 1446 flow [2023-08-29 20:50:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:50:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:50:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2023-08-29 20:50:53,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47597597597597596 [2023-08-29 20:50:53,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 634 transitions. [2023-08-29 20:50:53,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions. [2023-08-29 20:50:53,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:53,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions. [2023-08-29 20:50:53,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,978 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,978 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 745 flow. Second operand 6 states and 634 transitions. [2023-08-29 20:50:53,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 118 transitions, 1446 flow [2023-08-29 20:50:53,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 1427 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:53,989 INFO L231 Difference]: Finished difference. Result has 66 places, 84 transitions, 1034 flow [2023-08-29 20:50:53,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1034, PETRI_PLACES=66, PETRI_TRANSITIONS=84} [2023-08-29 20:50:53,990 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2023-08-29 20:50:53,990 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 84 transitions, 1034 flow [2023-08-29 20:50:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:53,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:50:53,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:53,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 163727894, now seen corresponding path program 1 times [2023-08-29 20:50:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847208174] [2023-08-29 20:50:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:54,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:54,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847208174] [2023-08-29 20:50:54,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847208174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:54,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:54,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080972275] [2023-08-29 20:50:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:54,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:54,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2023-08-29 20:50:54,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 84 transitions, 1034 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:54,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2023-08-29 20:50:54,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:54,466 INFO L130 PetriNetUnfolder]: 1320/2154 cut-off events. [2023-08-29 20:50:54,466 INFO L131 PetriNetUnfolder]: For 12973/13079 co-relation queries the response was YES. [2023-08-29 20:50:54,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12068 conditions, 2154 events. 1320/2154 cut-off events. For 12973/13079 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11372 event pairs, 195 based on Foata normal form. 38/2164 useless extension candidates. Maximal degree in co-relation 12045. Up to 1545 conditions per place. [2023-08-29 20:50:54,477 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 80 selfloop transitions, 25 changer transitions 6/122 dead transitions. [2023-08-29 20:50:54,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 122 transitions, 1672 flow [2023-08-29 20:50:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-29 20:50:54,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828828828828829 [2023-08-29 20:50:54,480 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-29 20:50:54,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-29 20:50:54,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:54,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-29 20:50:54,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,483 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,483 INFO L175 Difference]: Start difference. First operand has 66 places, 84 transitions, 1034 flow. Second operand 5 states and 536 transitions. [2023-08-29 20:50:54,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 122 transitions, 1672 flow [2023-08-29 20:50:54,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 1658 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:54,509 INFO L231 Difference]: Finished difference. Result has 71 places, 98 transitions, 1307 flow [2023-08-29 20:50:54,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1307, PETRI_PLACES=71, PETRI_TRANSITIONS=98} [2023-08-29 20:50:54,509 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2023-08-29 20:50:54,509 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 98 transitions, 1307 flow [2023-08-29 20:50:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:54,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:54,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:50:54,510 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:54,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 72787844, now seen corresponding path program 2 times [2023-08-29 20:50:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975151168] [2023-08-29 20:50:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:54,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975151168] [2023-08-29 20:50:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975151168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680066978] [2023-08-29 20:50:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:54,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:54,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:54,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2023-08-29 20:50:54,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 98 transitions, 1307 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:54,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2023-08-29 20:50:54,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:55,073 INFO L130 PetriNetUnfolder]: 1417/2319 cut-off events. [2023-08-29 20:50:55,074 INFO L131 PetriNetUnfolder]: For 18059/18163 co-relation queries the response was YES. [2023-08-29 20:50:55,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14046 conditions, 2319 events. 1417/2319 cut-off events. For 18059/18163 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12649 event pairs, 510 based on Foata normal form. 93/2378 useless extension candidates. Maximal degree in co-relation 14020. Up to 1760 conditions per place. [2023-08-29 20:50:55,087 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 76 selfloop transitions, 39 changer transitions 4/130 dead transitions. [2023-08-29 20:50:55,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 130 transitions, 1954 flow [2023-08-29 20:50:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-29 20:50:55,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2023-08-29 20:50:55,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-29 20:50:55,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-29 20:50:55,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:55,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-29 20:50:55,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,093 INFO L175 Difference]: Start difference. First operand has 71 places, 98 transitions, 1307 flow. Second operand 5 states and 531 transitions. [2023-08-29 20:50:55,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 130 transitions, 1954 flow [2023-08-29 20:50:55,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 130 transitions, 1936 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:55,116 INFO L231 Difference]: Finished difference. Result has 77 places, 114 transitions, 1696 flow [2023-08-29 20:50:55,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1696, PETRI_PLACES=77, PETRI_TRANSITIONS=114} [2023-08-29 20:50:55,117 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2023-08-29 20:50:55,117 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 114 transitions, 1696 flow [2023-08-29 20:50:55,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:55,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:55,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:50:55,118 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:55,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash 72826904, now seen corresponding path program 3 times [2023-08-29 20:50:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792646185] [2023-08-29 20:50:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792646185] [2023-08-29 20:50:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792646185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:55,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392099508] [2023-08-29 20:50:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:55,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:55,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:55,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2023-08-29 20:50:55,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 114 transitions, 1696 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:55,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2023-08-29 20:50:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:55,749 INFO L130 PetriNetUnfolder]: 1371/2251 cut-off events. [2023-08-29 20:50:55,749 INFO L131 PetriNetUnfolder]: For 20945/21091 co-relation queries the response was YES. [2023-08-29 20:50:55,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14712 conditions, 2251 events. 1371/2251 cut-off events. For 20945/21091 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12181 event pairs, 220 based on Foata normal form. 59/2285 useless extension candidates. Maximal degree in co-relation 14683. Up to 1634 conditions per place. [2023-08-29 20:50:55,762 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 92 selfloop transitions, 33 changer transitions 2/138 dead transitions. [2023-08-29 20:50:55,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 138 transitions, 2213 flow [2023-08-29 20:50:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-08-29 20:50:55,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2023-08-29 20:50:55,764 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-08-29 20:50:55,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-08-29 20:50:55,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:55,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-08-29 20:50:55,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,767 INFO L175 Difference]: Start difference. First operand has 77 places, 114 transitions, 1696 flow. Second operand 5 states and 535 transitions. [2023-08-29 20:50:55,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 138 transitions, 2213 flow [2023-08-29 20:50:55,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 2176 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:55,794 INFO L231 Difference]: Finished difference. Result has 81 places, 120 transitions, 1846 flow [2023-08-29 20:50:55,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1846, PETRI_PLACES=81, PETRI_TRANSITIONS=120} [2023-08-29 20:50:55,796 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2023-08-29 20:50:55,796 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 120 transitions, 1846 flow [2023-08-29 20:50:55,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:55,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:55,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:50:55,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:55,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 832949948, now seen corresponding path program 1 times [2023-08-29 20:50:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376687107] [2023-08-29 20:50:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376687107] [2023-08-29 20:50:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376687107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:50:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663240510] [2023-08-29 20:50:55,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:55,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:50:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:55,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:50:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:50:55,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-08-29 20:50:55,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 120 transitions, 1846 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:55,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-08-29 20:50:55,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:56,225 INFO L130 PetriNetUnfolder]: 1769/2934 cut-off events. [2023-08-29 20:50:56,226 INFO L131 PetriNetUnfolder]: For 33035/33213 co-relation queries the response was YES. [2023-08-29 20:50:56,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18730 conditions, 2934 events. 1769/2934 cut-off events. For 33035/33213 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 17407 event pairs, 522 based on Foata normal form. 200/3100 useless extension candidates. Maximal degree in co-relation 18700. Up to 1497 conditions per place. [2023-08-29 20:50:56,241 INFO L137 encePairwiseOnDemand]: 219/222 looper letters, 109 selfloop transitions, 11 changer transitions 23/152 dead transitions. [2023-08-29 20:50:56,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 152 transitions, 2581 flow [2023-08-29 20:50:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:50:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:50:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-29 20:50:56,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2023-08-29 20:50:56,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-29 20:50:56,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-29 20:50:56,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:56,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-29 20:50:56,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,245 INFO L175 Difference]: Start difference. First operand has 81 places, 120 transitions, 1846 flow. Second operand 3 states and 328 transitions. [2023-08-29 20:50:56,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 152 transitions, 2581 flow [2023-08-29 20:50:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 152 transitions, 2563 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:56,276 INFO L231 Difference]: Finished difference. Result has 84 places, 110 transitions, 1646 flow [2023-08-29 20:50:56,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=84, PETRI_TRANSITIONS=110} [2023-08-29 20:50:56,277 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-29 20:50:56,277 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 110 transitions, 1646 flow [2023-08-29 20:50:56,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:56,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:56,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:50:56,278 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:56,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1034668733, now seen corresponding path program 1 times [2023-08-29 20:50:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362802979] [2023-08-29 20:50:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362802979] [2023-08-29 20:50:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362802979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:50:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141429738] [2023-08-29 20:50:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:50:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:50:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:50:56,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 222 [2023-08-29 20:50:56,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 110 transitions, 1646 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:56,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 222 [2023-08-29 20:50:56,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:57,024 INFO L130 PetriNetUnfolder]: 1814/3067 cut-off events. [2023-08-29 20:50:57,025 INFO L131 PetriNetUnfolder]: For 32684/32875 co-relation queries the response was YES. [2023-08-29 20:50:57,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19598 conditions, 3067 events. 1814/3067 cut-off events. For 32684/32875 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 18641 event pairs, 345 based on Foata normal form. 87/3142 useless extension candidates. Maximal degree in co-relation 19566. Up to 2327 conditions per place. [2023-08-29 20:50:57,039 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 97 selfloop transitions, 26 changer transitions 4/138 dead transitions. [2023-08-29 20:50:57,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 138 transitions, 2245 flow [2023-08-29 20:50:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-29 20:50:57,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2023-08-29 20:50:57,042 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-29 20:50:57,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-29 20:50:57,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:57,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-29 20:50:57,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:57,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:57,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:57,044 INFO L175 Difference]: Start difference. First operand has 84 places, 110 transitions, 1646 flow. Second operand 5 states and 531 transitions. [2023-08-29 20:50:57,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 138 transitions, 2245 flow [2023-08-29 20:50:57,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 2232 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:57,084 INFO L231 Difference]: Finished difference. Result has 88 places, 113 transitions, 1783 flow [2023-08-29 20:50:57,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1783, PETRI_PLACES=88, PETRI_TRANSITIONS=113} [2023-08-29 20:50:57,085 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 49 predicate places. [2023-08-29 20:50:57,085 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 1783 flow [2023-08-29 20:50:57,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:57,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:57,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:57,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:50:57,086 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:57,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 489404463, now seen corresponding path program 2 times [2023-08-29 20:50:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839970391] [2023-08-29 20:50:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:57,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839970391] [2023-08-29 20:50:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839970391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:50:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50084926] [2023-08-29 20:50:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:57,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:50:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:50:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:50:57,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-29 20:50:57,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 1783 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:57,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:57,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-29 20:50:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:58,100 INFO L130 PetriNetUnfolder]: 2171/3574 cut-off events. [2023-08-29 20:50:58,101 INFO L131 PetriNetUnfolder]: For 34186/34186 co-relation queries the response was YES. [2023-08-29 20:50:58,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22359 conditions, 3574 events. 2171/3574 cut-off events. For 34186/34186 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20646 event pairs, 514 based on Foata normal form. 8/3582 useless extension candidates. Maximal degree in co-relation 22326. Up to 2275 conditions per place. [2023-08-29 20:50:58,115 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 86 selfloop transitions, 49 changer transitions 12/147 dead transitions. [2023-08-29 20:50:58,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 147 transitions, 2466 flow [2023-08-29 20:50:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-08-29 20:50:58,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2023-08-29 20:50:58,118 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-08-29 20:50:58,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-08-29 20:50:58,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:58,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-08-29 20:50:58,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,121 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,121 INFO L175 Difference]: Start difference. First operand has 88 places, 113 transitions, 1783 flow. Second operand 5 states and 500 transitions. [2023-08-29 20:50:58,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 147 transitions, 2466 flow [2023-08-29 20:50:58,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 147 transitions, 2420 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:58,163 INFO L231 Difference]: Finished difference. Result has 90 places, 111 transitions, 1878 flow [2023-08-29 20:50:58,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1737, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1878, PETRI_PLACES=90, PETRI_TRANSITIONS=111} [2023-08-29 20:50:58,164 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 51 predicate places. [2023-08-29 20:50:58,165 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 111 transitions, 1878 flow [2023-08-29 20:50:58,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:58,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:58,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:50:58,165 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:58,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 581723703, now seen corresponding path program 3 times [2023-08-29 20:50:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32082080] [2023-08-29 20:50:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32082080] [2023-08-29 20:50:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32082080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:58,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:58,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:58,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351231654] [2023-08-29 20:50:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:58,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:58,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:58,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-29 20:50:58,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 111 transitions, 1878 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 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-29 20:50:58,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:58,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-29 20:50:58,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:59,114 INFO L130 PetriNetUnfolder]: 2290/3790 cut-off events. [2023-08-29 20:50:59,114 INFO L131 PetriNetUnfolder]: For 42112/42112 co-relation queries the response was YES. [2023-08-29 20:50:59,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24590 conditions, 3790 events. 2290/3790 cut-off events. For 42112/42112 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22529 event pairs, 559 based on Foata normal form. 8/3798 useless extension candidates. Maximal degree in co-relation 24556. Up to 3083 conditions per place. [2023-08-29 20:50:59,133 INFO L137 encePairwiseOnDemand]: 212/222 looper letters, 107 selfloop transitions, 49 changer transitions 17/173 dead transitions. [2023-08-29 20:50:59,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 2886 flow [2023-08-29 20:50:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:50:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:50:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 792 transitions. [2023-08-29 20:50:59,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2023-08-29 20:50:59,137 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 792 transitions. [2023-08-29 20:50:59,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 792 transitions. [2023-08-29 20:50:59,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:59,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 792 transitions. [2023-08-29 20:50:59,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,141 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,141 INFO L175 Difference]: Start difference. First operand has 90 places, 111 transitions, 1878 flow. Second operand 8 states and 792 transitions. [2023-08-29 20:50:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 2886 flow [2023-08-29 20:50:59,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 173 transitions, 2769 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:50:59,197 INFO L231 Difference]: Finished difference. Result has 97 places, 129 transitions, 2270 flow [2023-08-29 20:50:59,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2270, PETRI_PLACES=97, PETRI_TRANSITIONS=129} [2023-08-29 20:50:59,198 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2023-08-29 20:50:59,198 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 129 transitions, 2270 flow [2023-08-29 20:50:59,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 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-29 20:50:59,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:59,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:59,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:50:59,199 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:59,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash 414456101, now seen corresponding path program 4 times [2023-08-29 20:50:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823599367] [2023-08-29 20:50:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:50:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823599367] [2023-08-29 20:50:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823599367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:50:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046856573] [2023-08-29 20:50:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:59,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:50:59,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:59,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:50:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:50:59,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 222 [2023-08-29 20:50:59,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 129 transitions, 2270 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:59,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 222 [2023-08-29 20:50:59,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:00,129 INFO L130 PetriNetUnfolder]: 1788/3056 cut-off events. [2023-08-29 20:51:00,130 INFO L131 PetriNetUnfolder]: For 43785/44025 co-relation queries the response was YES. [2023-08-29 20:51:00,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21481 conditions, 3056 events. 1788/3056 cut-off events. For 43785/44025 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 18923 event pairs, 314 based on Foata normal form. 106/3138 useless extension candidates. Maximal degree in co-relation 21443. Up to 1576 conditions per place. [2023-08-29 20:51:00,145 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 82 selfloop transitions, 39 changer transitions 25/150 dead transitions. [2023-08-29 20:51:00,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 150 transitions, 2761 flow [2023-08-29 20:51:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2023-08-29 20:51:00,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48018018018018016 [2023-08-29 20:51:00,147 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2023-08-29 20:51:00,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2023-08-29 20:51:00,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:00,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2023-08-29 20:51:00,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,150 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,150 INFO L175 Difference]: Start difference. First operand has 97 places, 129 transitions, 2270 flow. Second operand 5 states and 533 transitions. [2023-08-29 20:51:00,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 150 transitions, 2761 flow [2023-08-29 20:51:00,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 150 transitions, 2613 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:00,207 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 1939 flow [2023-08-29 20:51:00,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1939, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2023-08-29 20:51:00,207 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2023-08-29 20:51:00,207 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 1939 flow [2023-08-29 20:51:00,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:00,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:00,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:51:00,208 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:00,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2071953481, now seen corresponding path program 1 times [2023-08-29 20:51:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:00,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273219981] [2023-08-29 20:51:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:00,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273219981] [2023-08-29 20:51:00,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273219981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:00,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:00,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465853083] [2023-08-29 20:51:00,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:00,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:00,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:00,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:00,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:00,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2023-08-29 20:51:00,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 1939 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:00,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2023-08-29 20:51:00,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:00,612 INFO L130 PetriNetUnfolder]: 811/1376 cut-off events. [2023-08-29 20:51:00,612 INFO L131 PetriNetUnfolder]: For 18886/18940 co-relation queries the response was YES. [2023-08-29 20:51:00,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9507 conditions, 1376 events. 811/1376 cut-off events. For 18886/18940 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7143 event pairs, 192 based on Foata normal form. 60/1403 useless extension candidates. Maximal degree in co-relation 9468. Up to 1076 conditions per place. [2023-08-29 20:51:00,621 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 89 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2023-08-29 20:51:00,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 2242 flow [2023-08-29 20:51:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 632 transitions. [2023-08-29 20:51:00,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2023-08-29 20:51:00,623 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 632 transitions. [2023-08-29 20:51:00,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 632 transitions. [2023-08-29 20:51:00,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:00,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 632 transitions. [2023-08-29 20:51:00,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,626 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,627 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 1939 flow. Second operand 6 states and 632 transitions. [2023-08-29 20:51:00,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 2242 flow [2023-08-29 20:51:00,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 121 transitions, 2001 flow, removed 29 selfloop flow, removed 15 redundant places. [2023-08-29 20:51:00,652 INFO L231 Difference]: Finished difference. Result has 87 places, 109 transitions, 1740 flow [2023-08-29 20:51:00,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1740, PETRI_PLACES=87, PETRI_TRANSITIONS=109} [2023-08-29 20:51:00,653 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2023-08-29 20:51:00,653 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 109 transitions, 1740 flow [2023-08-29 20:51:00,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:00,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:00,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:51:00,654 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:00,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:00,654 INFO L85 PathProgramCache]: Analyzing trace with hash -759573781, now seen corresponding path program 1 times [2023-08-29 20:51:00,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591528134] [2023-08-29 20:51:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591528134] [2023-08-29 20:51:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591528134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11352142] [2023-08-29 20:51:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:00,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:00,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 222 [2023-08-29 20:51:00,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 109 transitions, 1740 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:00,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 222 [2023-08-29 20:51:00,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:00,908 INFO L130 PetriNetUnfolder]: 534/972 cut-off events. [2023-08-29 20:51:00,908 INFO L131 PetriNetUnfolder]: For 17831/17971 co-relation queries the response was YES. [2023-08-29 20:51:00,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6129 conditions, 972 events. 534/972 cut-off events. For 17831/17971 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5363 event pairs, 69 based on Foata normal form. 255/1225 useless extension candidates. Maximal degree in co-relation 6098. Up to 585 conditions per place. [2023-08-29 20:51:00,913 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 87 selfloop transitions, 4 changer transitions 71/170 dead transitions. [2023-08-29 20:51:00,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 2985 flow [2023-08-29 20:51:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-08-29 20:51:00,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46936936936936935 [2023-08-29 20:51:00,915 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-08-29 20:51:00,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-08-29 20:51:00,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:00,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-08-29 20:51:00,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,918 INFO L175 Difference]: Start difference. First operand has 87 places, 109 transitions, 1740 flow. Second operand 5 states and 521 transitions. [2023-08-29 20:51:00,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 170 transitions, 2985 flow [2023-08-29 20:51:00,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 170 transitions, 2788 flow, removed 58 selfloop flow, removed 10 redundant places. [2023-08-29 20:51:00,931 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 1148 flow [2023-08-29 20:51:00,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1148, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2023-08-29 20:51:00,931 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-29 20:51:00,932 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 1148 flow [2023-08-29 20:51:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:00,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:00,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:51:00,932 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:00,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 443710261, now seen corresponding path program 1 times [2023-08-29 20:51:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831255677] [2023-08-29 20:51:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831255677] [2023-08-29 20:51:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831255677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113607400] [2023-08-29 20:51:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:01,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:01,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 222 [2023-08-29 20:51:01,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 1148 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:01,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 222 [2023-08-29 20:51:01,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:01,161 INFO L130 PetriNetUnfolder]: 251/516 cut-off events. [2023-08-29 20:51:01,161 INFO L131 PetriNetUnfolder]: For 9927/9994 co-relation queries the response was YES. [2023-08-29 20:51:01,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 516 events. 251/516 cut-off events. For 9927/9994 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2620 event pairs, 11 based on Foata normal form. 131/645 useless extension candidates. Maximal degree in co-relation 3383. Up to 241 conditions per place. [2023-08-29 20:51:01,163 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 79 selfloop transitions, 7 changer transitions 43/136 dead transitions. [2023-08-29 20:51:01,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 136 transitions, 2171 flow [2023-08-29 20:51:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2023-08-29 20:51:01,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466966966966967 [2023-08-29 20:51:01,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions. [2023-08-29 20:51:01,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions. [2023-08-29 20:51:01,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:01,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions. [2023-08-29 20:51:01,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,169 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 1148 flow. Second operand 6 states and 622 transitions. [2023-08-29 20:51:01,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 136 transitions, 2171 flow [2023-08-29 20:51:01,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 2075 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-08-29 20:51:01,178 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 887 flow [2023-08-29 20:51:01,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=887, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2023-08-29 20:51:01,179 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2023-08-29 20:51:01,179 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 887 flow [2023-08-29 20:51:01,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:01,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:01,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:51:01,180 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:01,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:01,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1351860472, now seen corresponding path program 1 times [2023-08-29 20:51:01,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:01,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833343582] [2023-08-29 20:51:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:01,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833343582] [2023-08-29 20:51:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833343582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:01,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:01,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845082795] [2023-08-29 20:51:01,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:01,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:01,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:01,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:01,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 222 [2023-08-29 20:51:01,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 887 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:01,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 222 [2023-08-29 20:51:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:01,422 INFO L130 PetriNetUnfolder]: 129/299 cut-off events. [2023-08-29 20:51:01,422 INFO L131 PetriNetUnfolder]: For 3698/3737 co-relation queries the response was YES. [2023-08-29 20:51:01,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 299 events. 129/299 cut-off events. For 3698/3737 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1370 event pairs, 5 based on Foata normal form. 51/348 useless extension candidates. Maximal degree in co-relation 1981. Up to 133 conditions per place. [2023-08-29 20:51:01,423 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 36 selfloop transitions, 10 changer transitions 52/102 dead transitions. [2023-08-29 20:51:01,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 102 transitions, 1544 flow [2023-08-29 20:51:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 709 transitions. [2023-08-29 20:51:01,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45624195624195624 [2023-08-29 20:51:01,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 709 transitions. [2023-08-29 20:51:01,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 709 transitions. [2023-08-29 20:51:01,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:01,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 709 transitions. [2023-08-29 20:51:01,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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-29 20:51:01,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,430 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,430 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 887 flow. Second operand 7 states and 709 transitions. [2023-08-29 20:51:01,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 102 transitions, 1544 flow [2023-08-29 20:51:01,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 1396 flow, removed 40 selfloop flow, removed 8 redundant places. [2023-08-29 20:51:01,437 INFO L231 Difference]: Finished difference. Result has 82 places, 35 transitions, 351 flow [2023-08-29 20:51:01,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=82, PETRI_TRANSITIONS=35} [2023-08-29 20:51:01,438 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2023-08-29 20:51:01,438 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 35 transitions, 351 flow [2023-08-29 20:51:01,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:01,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:01,439 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-29 20:51:01,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:51:01,439 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:01,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1895630932, now seen corresponding path program 1 times [2023-08-29 20:51:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:01,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274207499] [2023-08-29 20:51:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:01,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:01,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:51:01,518 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:01,519 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:51:01,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:51:01,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:51:01,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:51:01,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:51:01,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:51:01,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:51:01,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:51:01,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:51:01,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:51:01,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:51:01,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:51:01,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:51:01,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:51:01,522 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:01,526 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:01,526 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:01,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:01 BasicIcfg [2023-08-29 20:51:01,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:01,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:01,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:01,580 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:01,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:43" (3/4) ... [2023-08-29 20:51:01,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:01,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:01,583 INFO L158 Benchmark]: Toolchain (without parser) took 18909.71ms. Allocated memory was 67.1MB in the beginning and 656.4MB in the end (delta: 589.3MB). Free memory was 42.7MB in the beginning and 575.6MB in the end (delta: -532.8MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2023-08-29 20:51:01,583 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 44.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:01,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.89ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 42.5MB in the beginning and 52.9MB in the end (delta: -10.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:01,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.63ms. Allocated memory is still 81.8MB. Free memory was 52.9MB in the beginning and 50.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:01,584 INFO L158 Benchmark]: Boogie Preprocessor took 29.76ms. Allocated memory is still 81.8MB. Free memory was 50.4MB in the beginning and 48.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:01,584 INFO L158 Benchmark]: RCFGBuilder took 571.63ms. Allocated memory is still 81.8MB. Free memory was 48.2MB in the beginning and 47.4MB in the end (delta: 827.3kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2023-08-29 20:51:01,584 INFO L158 Benchmark]: TraceAbstraction took 17824.87ms. Allocated memory was 81.8MB in the beginning and 656.4MB in the end (delta: 574.6MB). Free memory was 46.8MB in the beginning and 575.6MB in the end (delta: -528.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2023-08-29 20:51:01,584 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 656.4MB. Free memory is still 575.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:01,587 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.15ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 44.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.89ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 42.5MB in the beginning and 52.9MB in the end (delta: -10.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.63ms. Allocated memory is still 81.8MB. Free memory was 52.9MB in the beginning and 50.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.76ms. Allocated memory is still 81.8MB. Free memory was 50.4MB in the beginning and 48.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 571.63ms. Allocated memory is still 81.8MB. Free memory was 48.2MB in the beginning and 47.4MB in the end (delta: 827.3kB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17824.87ms. Allocated memory was 81.8MB in the beginning and 656.4MB in the end (delta: 574.6MB). Free memory was 46.8MB in the beginning and 575.6MB in the end (delta: -528.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 656.4MB. Free memory is still 575.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 120 PlacesBefore, 39 PlacesAfterwards, 112 TransitionsBefore, 29 TransitionsAfterwards, 1978 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 4917 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2422, independent: 2275, independent conditional: 0, independent unconditional: 2275, 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: 1088, independent: 1046, independent conditional: 0, independent unconditional: 1046, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2422, independent: 1229, independent conditional: 0, independent unconditional: 1229, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1088, unknown conditional: 0, unknown unconditional: 1088] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 814]: 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: 816]: 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, 141 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: 17.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 841 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2087 IncrementalHoareTripleChecker+Invalid, 2356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 219 mSDtfsCounter, 2087 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2270occurred in iteration=17, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:51:01,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:51:03,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:03,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:03,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:03,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:03,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:03,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:03,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:03,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:03,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:03,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:03,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:03,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:03,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:03,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:03,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:03,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:03,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:03,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:03,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:03,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:03,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:03,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:03,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:03,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:03,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:03,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:03,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:03,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:03,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:03,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:03,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:03,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:03,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:03,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:03,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:03,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:03,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:03,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:03,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:03,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:03,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:51:03,285 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:03,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:03,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:03,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:03,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:03,288 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:03,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:03,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:03,288 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:03,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:03,289 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:03,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:03,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:03,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:03,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:03,290 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:03,290 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:03,290 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:03,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:03,291 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:03,291 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:51:03,291 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:51:03,291 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:03,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:03,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:51:03,292 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:51:03,293 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:03,293 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:03,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:03,293 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:51:03,293 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:03,293 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:51:03,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:03,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:03,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:03,544 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:03,546 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:03,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:51:04,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:04,658 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:04,658 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:51:04,678 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11187fb83/f42606cc272e485986e0e5dbf96f82a8/FLAG8544a1ffd [2023-08-29 20:51:04,692 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11187fb83/f42606cc272e485986e0e5dbf96f82a8 [2023-08-29 20:51:04,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:04,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:04,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:04,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:04,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:04,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:04" (1/1) ... [2023-08-29 20:51:04,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee5bf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:04, skipping insertion in model container [2023-08-29 20:51:04,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:04" (1/1) ... [2023-08-29 20:51:04,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:04,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:04,884 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:51:05,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:05,049 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:05,056 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-29 20:51:05,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:05,143 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:05,144 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:05,148 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:05,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05 WrapperNode [2023-08-29 20:51:05,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:05,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:05,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:05,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:05,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,191 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-29 20:51:05,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:05,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:05,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:05,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:05,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,223 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:05,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:05,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:05,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:05,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (1/1) ... [2023-08-29 20:51:05,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:05,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:51:05,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:51:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:05,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:51:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:51:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:05,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:05,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:51:05,287 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:51:05,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:05,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:05,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:05,289 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:51:05,406 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:05,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:05,638 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:05,800 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:05,801 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:05,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:05 BoogieIcfgContainer [2023-08-29 20:51:05,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:05,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:05,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:05,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:05,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:04" (1/3) ... [2023-08-29 20:51:05,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e77949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:05, skipping insertion in model container [2023-08-29 20:51:05,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:05" (2/3) ... [2023-08-29 20:51:05,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e77949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:05, skipping insertion in model container [2023-08-29 20:51:05,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:05" (3/3) ... [2023-08-29 20:51:05,807 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:51:05,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:05,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:51:05,818 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:05,874 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:05,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-08-29 20:51:05,951 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-29 20:51:05,951 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:05,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:51:05,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-08-29 20:51:05,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-08-29 20:51:05,961 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:05,970 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-29 20:51:05,973 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-29 20:51:05,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-08-29 20:51:06,004 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-29 20:51:06,005 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:06,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-29 20:51:06,007 INFO L119 LiptonReduction]: Number of co-enabled transitions 1978 [2023-08-29 20:51:10,927 INFO L134 LiptonReduction]: Checked pairs total: 4977 [2023-08-29 20:51:10,928 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-29 20:51:10,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:10,941 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;@3422fb56, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:10,941 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:51:10,942 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:51:10,942 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:10,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:10,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:10,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:10,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash 498, now seen corresponding path program 1 times [2023-08-29 20:51:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095161644] [2023-08-29 20:51:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:10,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:10,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:10,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:51:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:11,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:51:11,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:11,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:11,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095161644] [2023-08-29 20:51:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095161644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854217642] [2023-08-29 20:51:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:11,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:11,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:11,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:11,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 226 [2023-08-29 20:51:11,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:11,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 226 [2023-08-29 20:51:11,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:11,266 INFO L130 PetriNetUnfolder]: 777/1182 cut-off events. [2023-08-29 20:51:11,267 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:51:11,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1182 events. 777/1182 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5441 event pairs, 777 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 2376. Up to 1169 conditions per place. [2023-08-29 20:51:11,273 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-29 20:51:11,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 95 flow [2023-08-29 20:51:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:51:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:51:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 234 transitions. [2023-08-29 20:51:11,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5176991150442478 [2023-08-29 20:51:11,282 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 234 transitions. [2023-08-29 20:51:11,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 234 transitions. [2023-08-29 20:51:11,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:11,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 234 transitions. [2023-08-29 20:51:11,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,289 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,290 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 234 transitions. [2023-08-29 20:51:11,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 95 flow [2023-08-29 20:51:11,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:11,292 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-29 20:51:11,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-29 20:51:11,296 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-29 20:51:11,296 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-29 20:51:11,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:11,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:11,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:51:11,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:11,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:11,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1723557802, now seen corresponding path program 1 times [2023-08-29 20:51:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639388126] [2023-08-29 20:51:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:11,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:11,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:11,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:11,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:51:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:11,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:11,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:11,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:11,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:11,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639388126] [2023-08-29 20:51:11,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639388126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:11,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:11,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174107588] [2023-08-29 20:51:11,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:11,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:11,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 226 [2023-08-29 20:51:11,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:11,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 226 [2023-08-29 20:51:11,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:11,786 INFO L130 PetriNetUnfolder]: 615/1011 cut-off events. [2023-08-29 20:51:11,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:11,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1011 events. 615/1011 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5053 event pairs, 129 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1977. Up to 703 conditions per place. [2023-08-29 20:51:11,790 INFO L137 encePairwiseOnDemand]: 223/226 looper letters, 25 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-29 20:51:11,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 128 flow [2023-08-29 20:51:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-29 20:51:11,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:51:11,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-29 20:51:11,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-29 20:51:11,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:11,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-29 20:51:11,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,796 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 339 transitions. [2023-08-29 20:51:11,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 128 flow [2023-08-29 20:51:11,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:11,797 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-29 20:51:11,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-29 20:51:11,797 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-29 20:51:11,797 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-29 20:51:11,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:11,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:11,808 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-29 20:51:12,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:12,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:12,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1518382114, now seen corresponding path program 1 times [2023-08-29 20:51:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612842978] [2023-08-29 20:51:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:12,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:12,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:12,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:12,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:51:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:12,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:12,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:12,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:12,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612842978] [2023-08-29 20:51:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612842978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431978476] [2023-08-29 20:51:12,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:12,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:12,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 226 [2023-08-29 20:51:12,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:12,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 226 [2023-08-29 20:51:12,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:12,285 INFO L130 PetriNetUnfolder]: 369/626 cut-off events. [2023-08-29 20:51:12,285 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-08-29 20:51:12,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 626 events. 369/626 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2842 event pairs, 74 based on Foata normal form. 48/641 useless extension candidates. Maximal degree in co-relation 1323. Up to 428 conditions per place. [2023-08-29 20:51:12,288 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 26 selfloop transitions, 4 changer transitions 17/50 dead transitions. [2023-08-29 20:51:12,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 214 flow [2023-08-29 20:51:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-08-29 20:51:12,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46814159292035395 [2023-08-29 20:51:12,290 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-08-29 20:51:12,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-08-29 20:51:12,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:12,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-08-29 20:51:12,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,294 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,295 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 529 transitions. [2023-08-29 20:51:12,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 214 flow [2023-08-29 20:51:12,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:12,296 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 84 flow [2023-08-29 20:51:12,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-29 20:51:12,297 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-08-29 20:51:12,297 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 84 flow [2023-08-29 20:51:12,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:12,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:12,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-29 20:51:12,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:12,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:12,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1234907220, now seen corresponding path program 1 times [2023-08-29 20:51:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:12,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750153364] [2023-08-29 20:51:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:12,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:12,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:12,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:51:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:12,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:51:12,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:12,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:12,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:12,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750153364] [2023-08-29 20:51:12,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750153364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:12,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103198714] [2023-08-29 20:51:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:12,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:12,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 226 [2023-08-29 20:51:12,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:12,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 226 [2023-08-29 20:51:12,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:12,750 INFO L130 PetriNetUnfolder]: 168/323 cut-off events. [2023-08-29 20:51:12,750 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2023-08-29 20:51:12,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 323 events. 168/323 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1293 event pairs, 36 based on Foata normal form. 30/341 useless extension candidates. Maximal degree in co-relation 891. Up to 118 conditions per place. [2023-08-29 20:51:12,751 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 33 selfloop transitions, 7 changer transitions 17/60 dead transitions. [2023-08-29 20:51:12,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 314 flow [2023-08-29 20:51:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2023-08-29 20:51:12,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46828908554572274 [2023-08-29 20:51:12,753 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 635 transitions. [2023-08-29 20:51:12,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions. [2023-08-29 20:51:12,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:12,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions. [2023-08-29 20:51:12,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,758 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 84 flow. Second operand 6 states and 635 transitions. [2023-08-29 20:51:12,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 314 flow [2023-08-29 20:51:12,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:12,761 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 134 flow [2023-08-29 20:51:12,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-29 20:51:12,762 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-29 20:51:12,762 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 134 flow [2023-08-29 20:51:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:12,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:12,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:12,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:12,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:12,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:12,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1610876500, now seen corresponding path program 1 times [2023-08-29 20:51:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34462010] [2023-08-29 20:51:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:12,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:12,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:12,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:12,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:51:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:13,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:51:13,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:13,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:13,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34462010] [2023-08-29 20:51:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34462010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854587843] [2023-08-29 20:51:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:13,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 226 [2023-08-29 20:51:13,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:13,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 226 [2023-08-29 20:51:13,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:13,257 INFO L130 PetriNetUnfolder]: 102/204 cut-off events. [2023-08-29 20:51:13,257 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2023-08-29 20:51:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 204 events. 102/204 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 711 event pairs, 32 based on Foata normal form. 9/209 useless extension candidates. Maximal degree in co-relation 623. Up to 77 conditions per place. [2023-08-29 20:51:13,258 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 30 selfloop transitions, 10 changer transitions 9/52 dead transitions. [2023-08-29 20:51:13,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 316 flow [2023-08-29 20:51:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-29 20:51:13,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45701643489254107 [2023-08-29 20:51:13,260 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-29 20:51:13,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-29 20:51:13,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:13,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-29 20:51:13,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,264 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,264 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 134 flow. Second operand 7 states and 723 transitions. [2023-08-29 20:51:13,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 316 flow [2023-08-29 20:51:13,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 280 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:13,267 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 136 flow [2023-08-29 20:51:13,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-29 20:51:13,268 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-29 20:51:13,268 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 136 flow [2023-08-29 20:51:13,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:13,268 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-29 20:51:13,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:13,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:13,490 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:13,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1020222529, now seen corresponding path program 1 times [2023-08-29 20:51:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352165275] [2023-08-29 20:51:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:13,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:13,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:13,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:13,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:51:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:13,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:13,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:13,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:13,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352165275] [2023-08-29 20:51:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352165275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:13,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679883845] [2023-08-29 20:51:13,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:13,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:13,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:13,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226 [2023-08-29 20:51:13,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:13,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226 [2023-08-29 20:51:13,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:13,657 INFO L130 PetriNetUnfolder]: 134/273 cut-off events. [2023-08-29 20:51:13,658 INFO L131 PetriNetUnfolder]: For 420/420 co-relation queries the response was YES. [2023-08-29 20:51:13,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 273 events. 134/273 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1111 event pairs, 71 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 820. Up to 179 conditions per place. [2023-08-29 20:51:13,659 INFO L137 encePairwiseOnDemand]: 223/226 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 20:51:13,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 322 flow [2023-08-29 20:51:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-29 20:51:13,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911504424778761 [2023-08-29 20:51:13,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-29 20:51:13,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-29 20:51:13,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:13,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-29 20:51:13,662 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-29 20:51:13,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,663 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 136 flow. Second operand 3 states and 333 transitions. [2023-08-29 20:51:13,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 322 flow [2023-08-29 20:51:13,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 248 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-29 20:51:13,665 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 110 flow [2023-08-29 20:51:13,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-29 20:51:13,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-29 20:51:13,666 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 110 flow [2023-08-29 20:51:13,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:13,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:13,666 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-29 20:51:13,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:13,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:13,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1280549925, now seen corresponding path program 1 times [2023-08-29 20:51:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534236111] [2023-08-29 20:51:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:13,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:13,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:13,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:13,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:51:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:13,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:51:13,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:14,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:14,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534236111] [2023-08-29 20:51:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534236111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340667354] [2023-08-29 20:51:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:14,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:14,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 226 [2023-08-29 20:51:14,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:14,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 226 [2023-08-29 20:51:14,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:14,431 INFO L130 PetriNetUnfolder]: 121/249 cut-off events. [2023-08-29 20:51:14,432 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2023-08-29 20:51:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 249 events. 121/249 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1037 event pairs, 15 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 730. Up to 200 conditions per place. [2023-08-29 20:51:14,433 INFO L137 encePairwiseOnDemand]: 222/226 looper letters, 23 selfloop transitions, 3 changer transitions 7/36 dead transitions. [2023-08-29 20:51:14,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 216 flow [2023-08-29 20:51:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2023-08-29 20:51:14,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41150442477876104 [2023-08-29 20:51:14,434 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2023-08-29 20:51:14,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2023-08-29 20:51:14,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:14,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2023-08-29 20:51:14,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,437 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 110 flow. Second operand 5 states and 465 transitions. [2023-08-29 20:51:14,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 216 flow [2023-08-29 20:51:14,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:14,438 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 108 flow [2023-08-29 20:51:14,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-08-29 20:51:14,439 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-29 20:51:14,439 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 108 flow [2023-08-29 20:51:14,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:14,439 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-29 20:51:14,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:14,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:14,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:14,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1347270327, now seen corresponding path program 2 times [2023-08-29 20:51:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641472301] [2023-08-29 20:51:14,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:51:14,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:14,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:14,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:51:14,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:14,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:14,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:14,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:14,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:14,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641472301] [2023-08-29 20:51:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641472301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:51:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775134717] [2023-08-29 20:51:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:14,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:14,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:14,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:14,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226 [2023-08-29 20:51:14,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:14,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226 [2023-08-29 20:51:14,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:14,794 INFO L130 PetriNetUnfolder]: 81/176 cut-off events. [2023-08-29 20:51:14,794 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2023-08-29 20:51:14,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 176 events. 81/176 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 623 event pairs, 38 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 506. Up to 114 conditions per place. [2023-08-29 20:51:14,795 INFO L137 encePairwiseOnDemand]: 223/226 looper letters, 27 selfloop transitions, 2 changer transitions 9/40 dead transitions. [2023-08-29 20:51:14,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 248 flow [2023-08-29 20:51:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-08-29 20:51:14,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48672566371681414 [2023-08-29 20:51:14,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-08-29 20:51:14,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-08-29 20:51:14,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:14,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-08-29 20:51:14,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,798 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 108 flow. Second operand 3 states and 330 transitions. [2023-08-29 20:51:14,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 248 flow [2023-08-29 20:51:14,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 237 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-29 20:51:14,799 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 105 flow [2023-08-29 20:51:14,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:51:14,799 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-29 20:51:14,800 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 105 flow [2023-08-29 20:51:14,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:14,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:14,800 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-29 20:51:14,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:15,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:15,009 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:15,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash 151294053, now seen corresponding path program 3 times [2023-08-29 20:51:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422265011] [2023-08-29 20:51:15,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:51:15,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:15,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:15,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:15,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:51:15,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:51:15,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:15,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-29 20:51:15,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:15,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-29 20:51:15,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:15,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422265011] [2023-08-29 20:51:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422265011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:51:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301554464] [2023-08-29 20:51:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:15,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:51:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:51:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:51:15,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 226 [2023-08-29 20:51:15,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:15,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:15,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 226 [2023-08-29 20:51:15,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:15,367 INFO L130 PetriNetUnfolder]: 40/98 cut-off events. [2023-08-29 20:51:15,367 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-08-29 20:51:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 98 events. 40/98 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 273 event pairs, 3 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 312. Up to 55 conditions per place. [2023-08-29 20:51:15,368 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 26 selfloop transitions, 3 changer transitions 15/46 dead transitions. [2023-08-29 20:51:15,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 288 flow [2023-08-29 20:51:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2023-08-29 20:51:15,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654867256637168 [2023-08-29 20:51:15,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2023-08-29 20:51:15,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2023-08-29 20:51:15,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:15,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2023-08-29 20:51:15,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:15,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:15,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:15,372 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 105 flow. Second operand 5 states and 526 transitions. [2023-08-29 20:51:15,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 288 flow [2023-08-29 20:51:15,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 277 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:15,373 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 110 flow [2023-08-29 20:51:15,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-29 20:51:15,373 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-29 20:51:15,373 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 110 flow [2023-08-29 20:51:15,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:15,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:15,374 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-29 20:51:15,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:15,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:15,581 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:15,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -78439891, now seen corresponding path program 4 times [2023-08-29 20:51:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637027673] [2023-08-29 20:51:15,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:51:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:15,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:51:15,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:51:15,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:51:15,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:51:15,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:15,766 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:51:15,767 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:15,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:51:15,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:51:15,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:51:15,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:51:15,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:51:15,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:51:15,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:15,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:15,970 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:15,974 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:15,974 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:16,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:16 BasicIcfg [2023-08-29 20:51:16,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:16,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:16,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:16,009 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:16,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:05" (3/4) ... [2023-08-29 20:51:16,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:16,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:16,012 INFO L158 Benchmark]: Toolchain (without parser) took 11312.01ms. Allocated memory was 86.0MB in the beginning and 157.3MB in the end (delta: 71.3MB). Free memory was 61.6MB in the beginning and 97.4MB in the end (delta: -35.8MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2023-08-29 20:51:16,012 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:16,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.51ms. Allocated memory is still 86.0MB. Free memory was 61.4MB in the beginning and 61.5MB in the end (delta: -161.3kB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-08-29 20:51:16,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.75ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:16,012 INFO L158 Benchmark]: Boogie Preprocessor took 29.99ms. Allocated memory is still 86.0MB. Free memory was 58.7MB in the beginning and 56.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:16,013 INFO L158 Benchmark]: RCFGBuilder took 575.96ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 43.4MB in the end (delta: 13.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2023-08-29 20:51:16,013 INFO L158 Benchmark]: TraceAbstraction took 10205.41ms. Allocated memory was 86.0MB in the beginning and 157.3MB in the end (delta: 71.3MB). Free memory was 42.9MB in the beginning and 97.4MB in the end (delta: -54.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-08-29 20:51:16,013 INFO L158 Benchmark]: Witness Printer took 2.21ms. Allocated memory is still 157.3MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:16,014 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.13ms. Allocated memory is still 60.8MB. Free memory is still 38.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.51ms. Allocated memory is still 86.0MB. Free memory was 61.4MB in the beginning and 61.5MB in the end (delta: -161.3kB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.75ms. Allocated memory is still 86.0MB. Free memory was 61.5MB in the beginning and 58.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.99ms. Allocated memory is still 86.0MB. Free memory was 58.7MB in the beginning and 56.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.96ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 43.4MB in the end (delta: 13.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10205.41ms. Allocated memory was 86.0MB in the beginning and 157.3MB in the end (delta: 71.3MB). Free memory was 42.9MB in the beginning and 97.4MB in the end (delta: -54.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 2.21ms. Allocated memory is still 157.3MB. Free memory is still 97.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: 5.0s, 121 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 29 TransitionsAfterwards, 1978 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 110 TotalNumberOfCompositions, 4977 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2491, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1090, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2491, independent: 1297, independent conditional: 0, independent unconditional: 1297, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1090, unknown conditional: 0, unknown unconditional: 1090] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=0, t2492={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=1, t2492={3:0}, t2493={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=2, t2492={3:0}, t2493={7:0}, t2494={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, t2494={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 814]: 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: 816]: 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, 142 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 877 IncrementalHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 48 mSDtfsCounter, 877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 39, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 9 QuantifiedInterpolants, 970 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1094 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:51:16,033 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