./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:15:06,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:15:06,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:15:06,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:15:06,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:15:06,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:15:06,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:15:06,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:15:06,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:15:06,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:15:06,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:15:06,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:15:06,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:15:06,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:15:06,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:15:06,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:15:06,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:15:06,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:15:06,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:15:06,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:15:06,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:15:06,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:15:06,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:15:06,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:15:06,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:15:06,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:15:06,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:15:06,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:15:06,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:15:06,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:15:06,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:15:06,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:15:06,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:15:06,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:15:06,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:15:06,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:15:06,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:15:06,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:15:06,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:15:06,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:15:06,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:15:06,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:15:06,575 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:15:06,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:15:06,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:15:06,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:15:06,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:15:06,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:15:06,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:15:06,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:15:06,579 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:15:06,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:15:06,580 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:15:06,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:15:06,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:15:06,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:15:06,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:15:06,581 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:15:06,581 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:15:06,581 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:15:06,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:15:06,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:15:06,582 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:15:06,582 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:15:06,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:15:06,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:15:06,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:15:06,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:15:06,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:15:06,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:15:06,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:15:06,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:15:06,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:15:06,584 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:15:06,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:15:06,585 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:15:06,585 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:15:06,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:15:06,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:15:06,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:15:06,925 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:15:06,925 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:15:06,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-31 23:15:08,075 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:15:08,343 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:15:08,343 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-31 23:15:08,358 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccc2e0a/eae876813b1140589641689188252c30/FLAG465e4ae8f [2023-08-31 23:15:08,372 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ccc2e0a/eae876813b1140589641689188252c30 [2023-08-31 23:15:08,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:15:08,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:15:08,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:15:08,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:15:08,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:15:08,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:15:08" (1/1) ... [2023-08-31 23:15:08,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e57a8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:08, skipping insertion in model container [2023-08-31 23:15:08,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:15:08" (1/1) ... [2023-08-31 23:15:08,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:15:08,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:15:08,632 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-08-31 23:15:08,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:15:08,870 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:15:08,888 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-08-31 23:15:08,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:15:09,051 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:15:09,052 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:15:09,058 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:15:09,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09 WrapperNode [2023-08-31 23:15:09,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:15:09,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:15:09,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:15:09,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:15:09,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,141 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-08-31 23:15:09,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:15:09,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:15:09,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:15:09,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:15:09,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:15:09,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:15:09,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:15:09,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:15:09,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (1/1) ... [2023-08-31 23:15:09,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:15:09,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:15:09,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:15:09,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:15:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:15:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:15:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:15:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:15:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:15:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:15:09,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:15:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:15:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:15:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:15:09,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:15:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:15:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:15:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:15:09,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:15:09,265 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:15:09,409 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:15:09,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:15:09,726 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:15:09,850 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:15:09,851 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:15:09,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:09 BoogieIcfgContainer [2023-08-31 23:15:09,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:15:09,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:15:09,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:15:09,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:15:09,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:15:08" (1/3) ... [2023-08-31 23:15:09,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fde92af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:15:09, skipping insertion in model container [2023-08-31 23:15:09,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:09" (2/3) ... [2023-08-31 23:15:09,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fde92af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:15:09, skipping insertion in model container [2023-08-31 23:15:09,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:09" (3/3) ... [2023-08-31 23:15:09,860 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-31 23:15:09,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:15:09,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:15:09,876 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:15:09,951 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:15:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2023-08-31 23:15:10,023 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-08-31 23:15:10,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:10,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:15:10,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2023-08-31 23:15:10,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2023-08-31 23:15:10,036 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:15:10,049 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2023-08-31 23:15:10,056 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2023-08-31 23:15:10,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2023-08-31 23:15:10,110 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-08-31 23:15:10,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:15:10,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-08-31 23:15:14,131 INFO L134 LiptonReduction]: Checked pairs total: 7472 [2023-08-31 23:15:14,131 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-31 23:15:14,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:15:14,158 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;@2e44775e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:15:14,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:15:14,161 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:15:14,161 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:14,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:14,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:15:14,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:14,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:14,168 INFO L85 PathProgramCache]: Analyzing trace with hash 535, now seen corresponding path program 1 times [2023-08-31 23:15:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132037736] [2023-08-31 23:15:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132037736] [2023-08-31 23:15:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132037736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:14,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:15:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027523043] [2023-08-31 23:15:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:15:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:14,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:15:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:15:14,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-31 23:15:14,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:14,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:14,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-31 23:15:14,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:14,791 INFO L130 PetriNetUnfolder]: 2255/3342 cut-off events. [2023-08-31 23:15:14,792 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-31 23:15:14,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6685 conditions, 3342 events. 2255/3342 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16847 event pairs, 2255 based on Foata normal form. 120/2908 useless extension candidates. Maximal degree in co-relation 6674. Up to 3277 conditions per place. [2023-08-31 23:15:14,812 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-31 23:15:14,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-08-31 23:15:14,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:15:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:15:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2023-08-31 23:15:14,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269709543568465 [2023-08-31 23:15:14,825 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 254 transitions. [2023-08-31 23:15:14,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 254 transitions. [2023-08-31 23:15:14,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:14,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 254 transitions. [2023-08-31 23:15:14,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:14,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 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-31 23:15:14,834 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 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-31 23:15:14,836 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 254 transitions. [2023-08-31 23:15:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-08-31 23:15:14,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:14,840 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-08-31 23:15:14,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:15:14,845 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-31 23:15:14,845 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-08-31 23:15:14,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:14,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:14,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:15:14,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:15:14,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:14,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash 527519, now seen corresponding path program 1 times [2023-08-31 23:15:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:14,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462489480] [2023-08-31 23:15:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462489480] [2023-08-31 23:15:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462489480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:15,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:15,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:15:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760776777] [2023-08-31 23:15:15,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:15,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:15,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:15,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:15,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:15,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-31 23:15:15,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:15,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-31 23:15:15,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:15,481 INFO L130 PetriNetUnfolder]: 1851/2883 cut-off events. [2023-08-31 23:15:15,481 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:15,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 2883 events. 1851/2883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16388 event pairs, 235 based on Foata normal form. 0/2579 useless extension candidates. Maximal degree in co-relation 5637. Up to 2297 conditions per place. [2023-08-31 23:15:15,507 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-31 23:15:15,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 184 flow [2023-08-31 23:15:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-31 23:15:15,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159059474412172 [2023-08-31 23:15:15,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-31 23:15:15,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-31 23:15:15,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:15,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-31 23:15:15,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,522 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 373 transitions. [2023-08-31 23:15:15,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 184 flow [2023-08-31 23:15:15,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:15:15,523 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-08-31 23:15:15,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-31 23:15:15,524 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-08-31 23:15:15,524 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-08-31 23:15:15,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:15,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:15,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:15:15,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:15,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 439297672, now seen corresponding path program 1 times [2023-08-31 23:15:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557882495] [2023-08-31 23:15:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:15,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557882495] [2023-08-31 23:15:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557882495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:15:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082035041] [2023-08-31 23:15:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:15,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:15,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:15,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 241 [2023-08-31 23:15:15,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:15,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:15,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 241 [2023-08-31 23:15:15,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:16,670 INFO L130 PetriNetUnfolder]: 4565/6616 cut-off events. [2023-08-31 23:15:16,670 INFO L131 PetriNetUnfolder]: For 316/316 co-relation queries the response was YES. [2023-08-31 23:15:16,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13652 conditions, 6616 events. 4565/6616 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 33485 event pairs, 1078 based on Foata normal form. 0/6344 useless extension candidates. Maximal degree in co-relation 13648. Up to 3167 conditions per place. [2023-08-31 23:15:16,703 INFO L137 encePairwiseOnDemand]: 231/241 looper letters, 62 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2023-08-31 23:15:16,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 332 flow [2023-08-31 23:15:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-08-31 23:15:16,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48132780082987553 [2023-08-31 23:15:16,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-08-31 23:15:16,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-08-31 23:15:16,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:16,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-08-31 23:15:16,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:16,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:16,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:16,711 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 5 states and 580 transitions. [2023-08-31 23:15:16,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 332 flow [2023-08-31 23:15:16,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 78 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:16,713 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 184 flow [2023-08-31 23:15:16,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2023-08-31 23:15:16,714 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-31 23:15:16,714 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 184 flow [2023-08-31 23:15:16,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:16,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:16,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:16,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:15:16,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:16,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 439297720, now seen corresponding path program 1 times [2023-08-31 23:15:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788905849] [2023-08-31 23:15:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788905849] [2023-08-31 23:15:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788905849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964404359] [2023-08-31 23:15:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:17,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:17,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-08-31 23:15:17,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:17,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:17,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-08-31 23:15:17,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:18,264 INFO L130 PetriNetUnfolder]: 5112/7919 cut-off events. [2023-08-31 23:15:18,264 INFO L131 PetriNetUnfolder]: For 6018/6325 co-relation queries the response was YES. [2023-08-31 23:15:18,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21288 conditions, 7919 events. 5112/7919 cut-off events. For 6018/6325 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 48635 event pairs, 2748 based on Foata normal form. 615/8385 useless extension candidates. Maximal degree in co-relation 21281. Up to 3194 conditions per place. [2023-08-31 23:15:18,317 INFO L137 encePairwiseOnDemand]: 236/241 looper letters, 62 selfloop transitions, 7 changer transitions 7/85 dead transitions. [2023-08-31 23:15:18,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 85 transitions, 504 flow [2023-08-31 23:15:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:15:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:15:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2023-08-31 23:15:18,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43983402489626555 [2023-08-31 23:15:18,320 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 636 transitions. [2023-08-31 23:15:18,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 636 transitions. [2023-08-31 23:15:18,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:18,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 636 transitions. [2023-08-31 23:15:18,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:18,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:18,328 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:18,329 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 184 flow. Second operand 6 states and 636 transitions. [2023-08-31 23:15:18,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 85 transitions, 504 flow [2023-08-31 23:15:18,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 85 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:15:18,343 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 235 flow [2023-08-31 23:15:18,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-31 23:15:18,344 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-08-31 23:15:18,344 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 235 flow [2023-08-31 23:15:18,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:18,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:18,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:18,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:15:18,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:18,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 684028399, now seen corresponding path program 1 times [2023-08-31 23:15:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:18,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754331574] [2023-08-31 23:15:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754331574] [2023-08-31 23:15:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754331574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:18,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27119427] [2023-08-31 23:15:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:18,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:18,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:18,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 241 [2023-08-31 23:15:18,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:18,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:18,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 241 [2023-08-31 23:15:18,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:19,703 INFO L130 PetriNetUnfolder]: 6438/9601 cut-off events. [2023-08-31 23:15:19,704 INFO L131 PetriNetUnfolder]: For 9888/9888 co-relation queries the response was YES. [2023-08-31 23:15:19,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28089 conditions, 9601 events. 6438/9601 cut-off events. For 9888/9888 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 54847 event pairs, 1934 based on Foata normal form. 240/9841 useless extension candidates. Maximal degree in co-relation 28077. Up to 4432 conditions per place. [2023-08-31 23:15:19,773 INFO L137 encePairwiseOnDemand]: 231/241 looper letters, 69 selfloop transitions, 18 changer transitions 24/111 dead transitions. [2023-08-31 23:15:19,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 111 transitions, 731 flow [2023-08-31 23:15:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 796 transitions. [2023-08-31 23:15:19,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718435091879075 [2023-08-31 23:15:19,776 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 796 transitions. [2023-08-31 23:15:19,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 796 transitions. [2023-08-31 23:15:19,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:19,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 796 transitions. [2023-08-31 23:15:19,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,782 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,783 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 235 flow. Second operand 7 states and 796 transitions. [2023-08-31 23:15:19,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 111 transitions, 731 flow [2023-08-31 23:15:19,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:15:19,827 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 350 flow [2023-08-31 23:15:19,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-31 23:15:19,828 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-08-31 23:15:19,828 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 350 flow [2023-08-31 23:15:19,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:19,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:19,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:19,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:15:19,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:19,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1644821300, now seen corresponding path program 1 times [2023-08-31 23:15:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479781632] [2023-08-31 23:15:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:20,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:20,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479781632] [2023-08-31 23:15:20,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479781632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:20,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:20,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:15:20,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170918474] [2023-08-31 23:15:20,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:20,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:15:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:20,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:15:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:15:20,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-08-31 23:15:20,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:20,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:20,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-08-31 23:15:20,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:21,618 INFO L130 PetriNetUnfolder]: 8413/13087 cut-off events. [2023-08-31 23:15:21,618 INFO L131 PetriNetUnfolder]: For 36969/37972 co-relation queries the response was YES. [2023-08-31 23:15:21,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42417 conditions, 13087 events. 8413/13087 cut-off events. For 36969/37972 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 88354 event pairs, 4478 based on Foata normal form. 562/13330 useless extension candidates. Maximal degree in co-relation 42400. Up to 6457 conditions per place. [2023-08-31 23:15:21,712 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 68 selfloop transitions, 16 changer transitions 6/101 dead transitions. [2023-08-31 23:15:21,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 866 flow [2023-08-31 23:15:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-08-31 23:15:21,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4344991108476586 [2023-08-31 23:15:21,715 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-08-31 23:15:21,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-08-31 23:15:21,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:21,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-08-31 23:15:21,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,721 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 350 flow. Second operand 7 states and 733 transitions. [2023-08-31 23:15:21,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 866 flow [2023-08-31 23:15:21,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 813 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-31 23:15:21,885 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 469 flow [2023-08-31 23:15:21,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-08-31 23:15:21,886 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-08-31 23:15:21,886 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 469 flow [2023-08-31 23:15:21,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:21,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:21,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:21,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:15:21,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:21,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1923877572, now seen corresponding path program 1 times [2023-08-31 23:15:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105792170] [2023-08-31 23:15:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:22,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-31 23:15:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:22,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105792170] [2023-08-31 23:15:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105792170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:22,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:22,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546562286] [2023-08-31 23:15:22,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:22,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:22,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:22,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:22,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 241 [2023-08-31 23:15:22,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 469 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-31 23:15:22,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:22,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 241 [2023-08-31 23:15:22,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:23,860 INFO L130 PetriNetUnfolder]: 10835/16304 cut-off events. [2023-08-31 23:15:23,860 INFO L131 PetriNetUnfolder]: For 47011/47011 co-relation queries the response was YES. [2023-08-31 23:15:23,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58661 conditions, 16304 events. 10835/16304 cut-off events. For 47011/47011 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 101796 event pairs, 1810 based on Foata normal form. 768/17072 useless extension candidates. Maximal degree in co-relation 58641. Up to 6219 conditions per place. [2023-08-31 23:15:23,942 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 105 selfloop transitions, 26 changer transitions 11/142 dead transitions. [2023-08-31 23:15:23,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 142 transitions, 1250 flow [2023-08-31 23:15:23,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-08-31 23:15:23,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46532305868405455 [2023-08-31 23:15:23,947 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-08-31 23:15:23,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-08-31 23:15:23,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:23,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-08-31 23:15:23,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,952 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:23,952 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 469 flow. Second operand 7 states and 785 transitions. [2023-08-31 23:15:23,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 142 transitions, 1250 flow [2023-08-31 23:15:24,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 142 transitions, 1250 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:15:24,149 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 752 flow [2023-08-31 23:15:24,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2023-08-31 23:15:24,150 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-08-31 23:15:24,150 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 752 flow [2023-08-31 23:15:24,150 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-31 23:15:24,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:24,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:24,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:15:24,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:24,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash 52260774, now seen corresponding path program 2 times [2023-08-31 23:15:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867378515] [2023-08-31 23:15:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867378515] [2023-08-31 23:15:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867378515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:24,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:15:24,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159695116] [2023-08-31 23:15:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:24,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:15:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:24,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:15:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:15:24,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 241 [2023-08-31 23:15:24,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:24,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:24,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 241 [2023-08-31 23:15:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:25,981 INFO L130 PetriNetUnfolder]: 8431/13474 cut-off events. [2023-08-31 23:15:25,981 INFO L131 PetriNetUnfolder]: For 61640/62749 co-relation queries the response was YES. [2023-08-31 23:15:26,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50818 conditions, 13474 events. 8431/13474 cut-off events. For 61640/62749 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 95064 event pairs, 4451 based on Foata normal form. 859/13969 useless extension candidates. Maximal degree in co-relation 50792. Up to 11548 conditions per place. [2023-08-31 23:15:26,077 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 59 selfloop transitions, 19 changer transitions 19/108 dead transitions. [2023-08-31 23:15:26,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 108 transitions, 1116 flow [2023-08-31 23:15:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 718 transitions. [2023-08-31 23:15:26,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42560758743331356 [2023-08-31 23:15:26,080 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 718 transitions. [2023-08-31 23:15:26,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 718 transitions. [2023-08-31 23:15:26,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:26,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 718 transitions. [2023-08-31 23:15:26,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:26,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:26,086 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:26,086 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 752 flow. Second operand 7 states and 718 transitions. [2023-08-31 23:15:26,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 108 transitions, 1116 flow [2023-08-31 23:15:26,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 1103 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:26,342 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 630 flow [2023-08-31 23:15:26,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2023-08-31 23:15:26,343 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2023-08-31 23:15:26,343 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 630 flow [2023-08-31 23:15:26,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:26,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:26,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:26,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:15:26,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:26,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1127020553, now seen corresponding path program 1 times [2023-08-31 23:15:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813332157] [2023-08-31 23:15:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:26,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813332157] [2023-08-31 23:15:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813332157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:15:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234844037] [2023-08-31 23:15:26,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:26,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:26,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:26,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-31 23:15:26,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:26,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:26,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-31 23:15:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:27,172 INFO L130 PetriNetUnfolder]: 3220/5568 cut-off events. [2023-08-31 23:15:27,172 INFO L131 PetriNetUnfolder]: For 25124/25821 co-relation queries the response was YES. [2023-08-31 23:15:27,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22424 conditions, 5568 events. 3220/5568 cut-off events. For 25124/25821 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 37556 event pairs, 699 based on Foata normal form. 472/5960 useless extension candidates. Maximal degree in co-relation 22396. Up to 4315 conditions per place. [2023-08-31 23:15:27,217 INFO L137 encePairwiseOnDemand]: 236/241 looper letters, 81 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2023-08-31 23:15:27,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 96 transitions, 1050 flow [2023-08-31 23:15:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-31 23:15:27,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951590594744122 [2023-08-31 23:15:27,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-31 23:15:27,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-31 23:15:27,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:27,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-31 23:15:27,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,224 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 630 flow. Second operand 3 states and 358 transitions. [2023-08-31 23:15:27,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 96 transitions, 1050 flow [2023-08-31 23:15:27,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 933 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-31 23:15:27,312 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 566 flow [2023-08-31 23:15:27,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-31 23:15:27,313 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2023-08-31 23:15:27,313 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 566 flow [2023-08-31 23:15:27,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:27,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:27,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:15:27,314 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:27,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1623823780, now seen corresponding path program 1 times [2023-08-31 23:15:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677748555] [2023-08-31 23:15:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:27,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677748555] [2023-08-31 23:15:27,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677748555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:27,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:27,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694134178] [2023-08-31 23:15:27,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:27,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:27,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-31 23:15:27,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 566 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:27,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-31 23:15:27,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:27,863 INFO L130 PetriNetUnfolder]: 1454/2806 cut-off events. [2023-08-31 23:15:27,863 INFO L131 PetriNetUnfolder]: For 8096/8258 co-relation queries the response was YES. [2023-08-31 23:15:27,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11967 conditions, 2806 events. 1454/2806 cut-off events. For 8096/8258 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18601 event pairs, 274 based on Foata normal form. 322/3081 useless extension candidates. Maximal degree in co-relation 11940. Up to 887 conditions per place. [2023-08-31 23:15:27,878 INFO L137 encePairwiseOnDemand]: 236/241 looper letters, 95 selfloop transitions, 7 changer transitions 0/113 dead transitions. [2023-08-31 23:15:27,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 1108 flow [2023-08-31 23:15:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:15:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:15:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-31 23:15:27,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495850622406639 [2023-08-31 23:15:27,882 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-31 23:15:27,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-31 23:15:27,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:27,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-31 23:15:27,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,886 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,886 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 566 flow. Second operand 4 states and 478 transitions. [2023-08-31 23:15:27,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 1108 flow [2023-08-31 23:15:27,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 1088 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-31 23:15:27,900 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 588 flow [2023-08-31 23:15:27,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=588, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2023-08-31 23:15:27,901 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-08-31 23:15:27,901 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 588 flow [2023-08-31 23:15:27,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:27,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:27,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:27,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:15:27,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:27,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -760749247, now seen corresponding path program 1 times [2023-08-31 23:15:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019636837] [2023-08-31 23:15:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:28,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019636837] [2023-08-31 23:15:28,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019636837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:28,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:28,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:15:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837527626] [2023-08-31 23:15:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:28,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:15:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:15:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:15:28,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 241 [2023-08-31 23:15:28,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 588 flow. Second operand has 9 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:28,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:28,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 241 [2023-08-31 23:15:28,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:30,089 INFO L130 PetriNetUnfolder]: 2433/4450 cut-off events. [2023-08-31 23:15:30,090 INFO L131 PetriNetUnfolder]: For 15057/15057 co-relation queries the response was YES. [2023-08-31 23:15:30,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20112 conditions, 4450 events. 2433/4450 cut-off events. For 15057/15057 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 29028 event pairs, 323 based on Foata normal form. 54/4504 useless extension candidates. Maximal degree in co-relation 20089. Up to 1280 conditions per place. [2023-08-31 23:15:30,125 INFO L137 encePairwiseOnDemand]: 229/241 looper letters, 132 selfloop transitions, 74 changer transitions 28/234 dead transitions. [2023-08-31 23:15:30,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 234 transitions, 2133 flow [2023-08-31 23:15:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:15:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:15:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1279 transitions. [2023-08-31 23:15:30,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44225449515905946 [2023-08-31 23:15:30,130 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1279 transitions. [2023-08-31 23:15:30,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1279 transitions. [2023-08-31 23:15:30,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:30,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1279 transitions. [2023-08-31 23:15:30,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 106.58333333333333) internal successors, (1279), 12 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 241.0) internal successors, (3133), 13 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,139 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 241.0) internal successors, (3133), 13 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,139 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 588 flow. Second operand 12 states and 1279 transitions. [2023-08-31 23:15:30,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 234 transitions, 2133 flow [2023-08-31 23:15:30,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 234 transitions, 2051 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:30,170 INFO L231 Difference]: Finished difference. Result has 89 places, 114 transitions, 1216 flow [2023-08-31 23:15:30,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1216, PETRI_PLACES=89, PETRI_TRANSITIONS=114} [2023-08-31 23:15:30,170 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2023-08-31 23:15:30,171 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 114 transitions, 1216 flow [2023-08-31 23:15:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.22222222222223) internal successors, (866), 9 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:30,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:30,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:15:30,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:30,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 137272725, now seen corresponding path program 2 times [2023-08-31 23:15:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759234186] [2023-08-31 23:15:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:30,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759234186] [2023-08-31 23:15:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759234186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:30,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117402455] [2023-08-31 23:15:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:30,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:30,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:30,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-31 23:15:30,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 114 transitions, 1216 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:30,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-31 23:15:30,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:30,941 INFO L130 PetriNetUnfolder]: 1553/2956 cut-off events. [2023-08-31 23:15:30,941 INFO L131 PetriNetUnfolder]: For 15574/15848 co-relation queries the response was YES. [2023-08-31 23:15:30,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14879 conditions, 2956 events. 1553/2956 cut-off events. For 15574/15848 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 20112 event pairs, 261 based on Foata normal form. 188/3090 useless extension candidates. Maximal degree in co-relation 14849. Up to 1117 conditions per place. [2023-08-31 23:15:30,961 INFO L137 encePairwiseOnDemand]: 236/241 looper letters, 139 selfloop transitions, 10 changer transitions 8/178 dead transitions. [2023-08-31 23:15:30,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 178 transitions, 2222 flow [2023-08-31 23:15:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-08-31 23:15:30,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854771784232365 [2023-08-31 23:15:30,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-08-31 23:15:30,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-08-31 23:15:30,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:30,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-08-31 23:15:30,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 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-31 23:15:30,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:30,968 INFO L175 Difference]: Start difference. First operand has 89 places, 114 transitions, 1216 flow. Second operand 5 states and 585 transitions. [2023-08-31 23:15:30,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 178 transitions, 2222 flow [2023-08-31 23:15:31,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 178 transitions, 2028 flow, removed 68 selfloop flow, removed 5 redundant places. [2023-08-31 23:15:31,017 INFO L231 Difference]: Finished difference. Result has 87 places, 113 transitions, 1131 flow [2023-08-31 23:15:31,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1131, PETRI_PLACES=87, PETRI_TRANSITIONS=113} [2023-08-31 23:15:31,017 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-08-31 23:15:31,018 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 113 transitions, 1131 flow [2023-08-31 23:15:31,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:31,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:31,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:31,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:15:31,019 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:31,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1464135428, now seen corresponding path program 1 times [2023-08-31 23:15:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462810931] [2023-08-31 23:15:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462810931] [2023-08-31 23:15:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462810931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:15:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133320199] [2023-08-31 23:15:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:31,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:31,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 241 [2023-08-31 23:15:31,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 113 transitions, 1131 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:31,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:31,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 241 [2023-08-31 23:15:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:31,976 INFO L130 PetriNetUnfolder]: 2452/4373 cut-off events. [2023-08-31 23:15:31,977 INFO L131 PetriNetUnfolder]: For 22489/22489 co-relation queries the response was YES. [2023-08-31 23:15:31,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22772 conditions, 4373 events. 2452/4373 cut-off events. For 22489/22489 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 28990 event pairs, 209 based on Foata normal form. 6/4379 useless extension candidates. Maximal degree in co-relation 22745. Up to 1852 conditions per place. [2023-08-31 23:15:31,998 INFO L137 encePairwiseOnDemand]: 231/241 looper letters, 86 selfloop transitions, 21 changer transitions 120/227 dead transitions. [2023-08-31 23:15:31,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 227 transitions, 2616 flow [2023-08-31 23:15:31,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2023-08-31 23:15:32,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45228215767634855 [2023-08-31 23:15:32,001 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 763 transitions. [2023-08-31 23:15:32,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 763 transitions. [2023-08-31 23:15:32,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:32,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 763 transitions. [2023-08-31 23:15:32,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:32,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:32,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:32,007 INFO L175 Difference]: Start difference. First operand has 87 places, 113 transitions, 1131 flow. Second operand 7 states and 763 transitions. [2023-08-31 23:15:32,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 227 transitions, 2616 flow [2023-08-31 23:15:32,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 227 transitions, 2444 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-08-31 23:15:32,164 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 804 flow [2023-08-31 23:15:32,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2023-08-31 23:15:32,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2023-08-31 23:15:32,165 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 804 flow [2023-08-31 23:15:32,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:32,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:32,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:32,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:15:32,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:32,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -992336018, now seen corresponding path program 2 times [2023-08-31 23:15:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060443899] [2023-08-31 23:15:32,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:15:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060443899] [2023-08-31 23:15:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060443899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:15:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766798531] [2023-08-31 23:15:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:32,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:15:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:15:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:15:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:15:32,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 241 [2023-08-31 23:15:32,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 804 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:32,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:32,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 241 [2023-08-31 23:15:32,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:33,355 INFO L130 PetriNetUnfolder]: 1055/2054 cut-off events. [2023-08-31 23:15:33,355 INFO L131 PetriNetUnfolder]: For 10706/10706 co-relation queries the response was YES. [2023-08-31 23:15:33,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10108 conditions, 2054 events. 1055/2054 cut-off events. For 10706/10706 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12623 event pairs, 133 based on Foata normal form. 4/2058 useless extension candidates. Maximal degree in co-relation 10081. Up to 603 conditions per place. [2023-08-31 23:15:33,364 INFO L137 encePairwiseOnDemand]: 230/241 looper letters, 55 selfloop transitions, 25 changer transitions 51/131 dead transitions. [2023-08-31 23:15:33,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 131 transitions, 1367 flow [2023-08-31 23:15:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:15:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:15:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 930 transitions. [2023-08-31 23:15:33,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4287690179806362 [2023-08-31 23:15:33,367 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 930 transitions. [2023-08-31 23:15:33,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 930 transitions. [2023-08-31 23:15:33,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:33,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 930 transitions. [2023-08-31 23:15:33,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:33,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:33,373 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:33,373 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 804 flow. Second operand 9 states and 930 transitions. [2023-08-31 23:15:33,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 131 transitions, 1367 flow [2023-08-31 23:15:33,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 1251 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-31 23:15:33,394 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 626 flow [2023-08-31 23:15:33,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2023-08-31 23:15:33,395 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2023-08-31 23:15:33,395 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 626 flow [2023-08-31 23:15:33,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:33,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:33,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:33,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:15:33,396 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:33,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash 167203808, now seen corresponding path program 3 times [2023-08-31 23:15:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:15:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526694586] [2023-08-31 23:15:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:15:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:15:33,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:15:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:15:33,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:15:33,497 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:15:33,498 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:15:33,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:15:33,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:15:33,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:15:33,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:15:33,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:15:33,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:15:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:15:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:15:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:15:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:15:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:15:33,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:15:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:15:33,503 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:33,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:15:33,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:15:33,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:15:33 BasicIcfg [2023-08-31 23:15:33,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:15:33,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:15:33,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:15:33,557 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:15:33,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:09" (3/4) ... [2023-08-31 23:15:33,559 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:15:33,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:15:33,560 INFO L158 Benchmark]: Toolchain (without parser) took 25183.96ms. Allocated memory was 83.9MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 60.3MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 247.6MB. Max. memory is 16.1GB. [2023-08-31 23:15:33,560 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:15:33,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.03ms. Allocated memory is still 83.9MB. Free memory was 60.1MB in the beginning and 56.7MB in the end (delta: 3.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:33,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.00ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 54.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:33,561 INFO L158 Benchmark]: Boogie Preprocessor took 47.05ms. Allocated memory is still 83.9MB. Free memory was 54.2MB in the beginning and 52.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:33,561 INFO L158 Benchmark]: RCFGBuilder took 662.57ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 39.8MB in the end (delta: 12.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-08-31 23:15:33,562 INFO L158 Benchmark]: TraceAbstraction took 23701.62ms. Allocated memory was 83.9MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 39.4MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. [2023-08-31 23:15:33,562 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 3.0GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:15:33,563 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 684.03ms. Allocated memory is still 83.9MB. Free memory was 60.1MB in the beginning and 56.7MB in the end (delta: 3.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.00ms. Allocated memory is still 83.9MB. Free memory was 56.7MB in the beginning and 54.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.05ms. Allocated memory is still 83.9MB. Free memory was 54.2MB in the beginning and 52.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.57ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 39.8MB in the end (delta: 12.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23701.62ms. Allocated memory was 83.9MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 39.4MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 225.0MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 3.0GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 2.7kB). 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.1s, 129 PlacesBefore, 44 PlacesAfterwards, 121 TransitionsBefore, 35 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 7472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3533, independent: 3314, independent conditional: 0, independent unconditional: 3314, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1352, independent: 1320, independent conditional: 0, independent unconditional: 1320, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3533, independent: 1994, independent conditional: 0, independent unconditional: 1994, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1352, unknown conditional: 0, unknown unconditional: 1352] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=-2, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=-1, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] 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, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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, 154 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: 23.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1040 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 527 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2941 IncrementalHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 100 mSDtfsCounter, 2941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1216occurred in iteration=11, InterpolantAutomatonStates: 84, 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, 4.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 2435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:15:33,584 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:15:35,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:15:35,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:15:35,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:15:35,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:15:35,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:15:35,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:15:35,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:15:35,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:15:35,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:15:35,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:15:35,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:15:35,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:15:35,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:15:35,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:15:35,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:15:35,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:15:35,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:15:35,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:15:35,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:15:35,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:15:35,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:15:35,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:15:35,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:15:35,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:15:35,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:15:35,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:15:35,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:15:35,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:15:35,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:15:35,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:15:35,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:15:35,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:15:35,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:15:35,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:15:35,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:15:35,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:15:35,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:15:35,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:15:35,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:15:35,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:15:35,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:15:35,786 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:15:35,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:15:35,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:15:35,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:15:35,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:15:35,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:15:35,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:15:35,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:15:35,790 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:15:35,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:15:35,791 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:15:35,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:15:35,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:15:35,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:15:35,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:15:35,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:15:35,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:15:35,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:15:35,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:15:35,793 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:15:35,793 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:15:35,793 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:15:35,793 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:15:35,794 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:15:35,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:15:35,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:15:35,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:15:35,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:15:35,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:15:35,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:15:35,795 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:15:35,796 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:15:35,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:15:35,796 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:15:35,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:15:35,797 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:15:35,797 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:15:35,797 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:15:36,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:15:36,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:15:36,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:15:36,181 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:15:36,181 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:15:36,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-31 23:15:37,351 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:15:37,559 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:15:37,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-31 23:15:37,573 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41137235d/0ae90cbfc0ac47c98ffa57730a04dfee/FLAGab57dd4e0 [2023-08-31 23:15:37,585 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41137235d/0ae90cbfc0ac47c98ffa57730a04dfee [2023-08-31 23:15:37,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:15:37,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:15:37,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:15:37,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:15:37,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:15:37,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:15:37" (1/1) ... [2023-08-31 23:15:37,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463aa0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:37, skipping insertion in model container [2023-08-31 23:15:37,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:15:37" (1/1) ... [2023-08-31 23:15:37,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:15:37,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:15:37,820 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-08-31 23:15:38,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:15:38,047 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:15:38,058 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2023-08-31 23:15:38,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:15:38,159 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:15:38,160 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:15:38,165 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:15:38,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38 WrapperNode [2023-08-31 23:15:38,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:15:38,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:15:38,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:15:38,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:15:38,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,245 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2023-08-31 23:15:38,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:15:38,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:15:38,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:15:38,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:15:38,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,296 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:15:38,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:15:38,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:15:38,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:15:38,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (1/1) ... [2023-08-31 23:15:38,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:15:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:15:38,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:15:38,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:15:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:15:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:15:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:15:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:15:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:15:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:15:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:15:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:15:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:15:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:15:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:15:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:15:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:15:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:15:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:15:38,384 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:15:38,598 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:15:38,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:15:38,910 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:15:39,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:15:39,077 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:15:39,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:39 BoogieIcfgContainer [2023-08-31 23:15:39,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:15:39,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:15:39,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:15:39,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:15:39,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:15:37" (1/3) ... [2023-08-31 23:15:39,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9dfdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:15:39, skipping insertion in model container [2023-08-31 23:15:39,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:15:38" (2/3) ... [2023-08-31 23:15:39,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9dfdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:15:39, skipping insertion in model container [2023-08-31 23:15:39,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:39" (3/3) ... [2023-08-31 23:15:39,086 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-08-31 23:15:39,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:15:39,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:15:39,102 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:15:39,176 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:15:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-08-31 23:15:39,285 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-31 23:15:39,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:39,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:15:39,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-08-31 23:15:39,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2023-08-31 23:15:39,301 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:15:39,313 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2023-08-31 23:15:39,316 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2023-08-31 23:15:39,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2023-08-31 23:15:39,357 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-31 23:15:39,358 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:39,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-31 23:15:39,362 INFO L119 LiptonReduction]: Number of co-enabled transitions 2498 [2023-08-31 23:15:45,570 INFO L134 LiptonReduction]: Checked pairs total: 7376 [2023-08-31 23:15:45,570 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-31 23:15:45,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:15:45,642 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;@18be5c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:15:45,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:15:45,643 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:15:45,643 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:45,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:45,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:15:45,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:45,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash 535, now seen corresponding path program 1 times [2023-08-31 23:15:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942961112] [2023-08-31 23:15:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:45,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:45,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:45,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:15:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:45,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:15:45,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:45,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:45,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942961112] [2023-08-31 23:15:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942961112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:45,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:15:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481302358] [2023-08-31 23:15:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:45,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:15:45,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:15:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:15:45,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 240 [2023-08-31 23:15:45,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:45,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:45,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 240 [2023-08-31 23:15:45,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:46,386 INFO L130 PetriNetUnfolder]: 2255/3342 cut-off events. [2023-08-31 23:15:46,387 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-31 23:15:46,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6685 conditions, 3342 events. 2255/3342 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16808 event pairs, 2255 based on Foata normal form. 120/2908 useless extension candidates. Maximal degree in co-relation 6674. Up to 3277 conditions per place. [2023-08-31 23:15:46,411 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-31 23:15:46,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 115 flow [2023-08-31 23:15:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:15:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:15:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2023-08-31 23:15:46,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-31 23:15:46,430 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2023-08-31 23:15:46,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2023-08-31 23:15:46,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:46,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2023-08-31 23:15:46,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:46,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:46,446 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:46,448 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 2 states and 256 transitions. [2023-08-31 23:15:46,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 115 flow [2023-08-31 23:15:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:46,455 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2023-08-31 23:15:46,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:15:46,460 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-31 23:15:46,461 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2023-08-31 23:15:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:46,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:46,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:15:46,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:46,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:46,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 527583, now seen corresponding path program 1 times [2023-08-31 23:15:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541024842] [2023-08-31 23:15:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:46,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:46,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:46,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:15:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:46,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:46,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:46,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:46,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:46,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541024842] [2023-08-31 23:15:46,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541024842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:46,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:15:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273730310] [2023-08-31 23:15:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:46,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 240 [2023-08-31 23:15:46,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 3 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-31 23:15:46,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:46,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 240 [2023-08-31 23:15:46,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:47,176 INFO L130 PetriNetUnfolder]: 1851/2751 cut-off events. [2023-08-31 23:15:47,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:47,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5508 conditions, 2751 events. 1851/2751 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13295 event pairs, 823 based on Foata normal form. 0/2447 useless extension candidates. Maximal degree in co-relation 5505. Up to 2297 conditions per place. [2023-08-31 23:15:47,188 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-31 23:15:47,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 184 flow [2023-08-31 23:15:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-31 23:15:47,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2023-08-31 23:15:47,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-31 23:15:47,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-31 23:15:47,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:47,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-31 23:15:47,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,198 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 3 states and 376 transitions. [2023-08-31 23:15:47,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 184 flow [2023-08-31 23:15:47,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:15:47,199 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 60 flow [2023-08-31 23:15:47,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-31 23:15:47,201 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -7 predicate places. [2023-08-31 23:15:47,201 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 60 flow [2023-08-31 23:15:47,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-31 23:15:47,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:47,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:47,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:47,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:47,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:47,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -656064817, now seen corresponding path program 1 times [2023-08-31 23:15:47,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:47,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056301339] [2023-08-31 23:15:47,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:47,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:47,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:15:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:47,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:47,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:47,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:47,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056301339] [2023-08-31 23:15:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056301339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:15:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509554071] [2023-08-31 23:15:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:47,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:47,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:47,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-31 23:15:47,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:47,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-31 23:15:47,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:47,738 INFO L130 PetriNetUnfolder]: 661/1095 cut-off events. [2023-08-31 23:15:47,738 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-31 23:15:47,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 1095 events. 661/1095 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5105 event pairs, 163 based on Foata normal form. 48/1085 useless extension candidates. Maximal degree in co-relation 2290. Up to 895 conditions per place. [2023-08-31 23:15:47,743 INFO L137 encePairwiseOnDemand]: 235/240 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-31 23:15:47,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 170 flow [2023-08-31 23:15:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-31 23:15:47,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027777777777778 [2023-08-31 23:15:47,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-31 23:15:47,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-31 23:15:47,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:47,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-31 23:15:47,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,750 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 60 flow. Second operand 3 states and 362 transitions. [2023-08-31 23:15:47,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 170 flow [2023-08-31 23:15:47,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:47,752 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 82 flow [2023-08-31 23:15:47,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:15:47,753 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2023-08-31 23:15:47,754 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 82 flow [2023-08-31 23:15:47,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:47,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:47,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:47,766 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-31 23:15:47,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:47,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:47,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash -757168767, now seen corresponding path program 1 times [2023-08-31 23:15:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:47,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003252096] [2023-08-31 23:15:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:47,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:47,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:47,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:15:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:48,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:15:48,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:48,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:48,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003252096] [2023-08-31 23:15:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003252096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:48,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:48,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538670459] [2023-08-31 23:15:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:48,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:48,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:48,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-31 23:15:48,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:48,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-31 23:15:48,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:48,291 INFO L130 PetriNetUnfolder]: 261/494 cut-off events. [2023-08-31 23:15:48,291 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2023-08-31 23:15:48,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 494 events. 261/494 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2054 event pairs, 102 based on Foata normal form. 40/517 useless extension candidates. Maximal degree in co-relation 1187. Up to 178 conditions per place. [2023-08-31 23:15:48,294 INFO L137 encePairwiseOnDemand]: 235/240 looper letters, 43 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-31 23:15:48,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 244 flow [2023-08-31 23:15:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:15:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:15:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-31 23:15:48,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2023-08-31 23:15:48,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-31 23:15:48,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-31 23:15:48,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:48,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-31 23:15:48,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,301 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,302 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 82 flow. Second operand 4 states and 483 transitions. [2023-08-31 23:15:48,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 244 flow [2023-08-31 23:15:48,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:15:48,304 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 118 flow [2023-08-31 23:15:48,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-31 23:15:48,305 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-08-31 23:15:48,305 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 118 flow [2023-08-31 23:15:48,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:48,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:48,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:48,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:48,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:48,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash 620185913, now seen corresponding path program 1 times [2023-08-31 23:15:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319426829] [2023-08-31 23:15:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:48,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:48,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:48,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:48,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:15:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:48,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:15:48,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:48,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:48,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319426829] [2023-08-31 23:15:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319426829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925532387] [2023-08-31 23:15:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:48,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:48,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:48,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-08-31 23:15:48,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:48,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-08-31 23:15:48,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:48,919 INFO L130 PetriNetUnfolder]: 206/384 cut-off events. [2023-08-31 23:15:48,920 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2023-08-31 23:15:48,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 384 events. 206/384 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1564 event pairs, 97 based on Foata normal form. 11/389 useless extension candidates. Maximal degree in co-relation 998. Up to 178 conditions per place. [2023-08-31 23:15:48,922 INFO L137 encePairwiseOnDemand]: 235/240 looper letters, 40 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2023-08-31 23:15:48,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 268 flow [2023-08-31 23:15:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-08-31 23:15:48,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925 [2023-08-31 23:15:48,925 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-08-31 23:15:48,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-08-31 23:15:48,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:48,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-08-31 23:15:48,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,931 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,931 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 118 flow. Second operand 5 states and 591 transitions. [2023-08-31 23:15:48,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 268 flow [2023-08-31 23:15:48,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 254 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:48,934 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 132 flow [2023-08-31 23:15:48,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-31 23:15:48,935 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-31 23:15:48,935 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 132 flow [2023-08-31 23:15:48,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:48,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:48,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:48,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:49,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:49,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:49,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1619439865, now seen corresponding path program 1 times [2023-08-31 23:15:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:49,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478842174] [2023-08-31 23:15:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:49,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:49,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:49,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:49,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:15:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:49,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:15:49,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:49,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:49,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:49,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478842174] [2023-08-31 23:15:49,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478842174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:49,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:15:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100295372] [2023-08-31 23:15:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:49,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:15:49,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:49,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:15:49,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:15:49,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 240 [2023-08-31 23:15:49,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 132 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:49,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:49,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 240 [2023-08-31 23:15:49,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:49,959 INFO L130 PetriNetUnfolder]: 228/427 cut-off events. [2023-08-31 23:15:49,959 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2023-08-31 23:15:49,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 427 events. 228/427 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1724 event pairs, 47 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 1200. Up to 154 conditions per place. [2023-08-31 23:15:49,961 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 63 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2023-08-31 23:15:49,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 468 flow [2023-08-31 23:15:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:15:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:15:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 879 transitions. [2023-08-31 23:15:49,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578125 [2023-08-31 23:15:49,965 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 879 transitions. [2023-08-31 23:15:49,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 879 transitions. [2023-08-31 23:15:49,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:49,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 879 transitions. [2023-08-31 23:15:49,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.875) internal successors, (879), 8 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:49,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:49,970 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 240.0) internal successors, (2160), 9 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:49,971 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 132 flow. Second operand 8 states and 879 transitions. [2023-08-31 23:15:49,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 468 flow [2023-08-31 23:15:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 406 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:49,974 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 138 flow [2023-08-31 23:15:49,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2023-08-31 23:15:49,975 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-08-31 23:15:49,975 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 138 flow [2023-08-31 23:15:49,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:49,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:49,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:49,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:50,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:50,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:50,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash -434358915, now seen corresponding path program 2 times [2023-08-31 23:15:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526457017] [2023-08-31 23:15:50,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:15:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:50,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:50,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:15:50,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:15:50,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:15:50,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:50,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:50,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:50,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526457017] [2023-08-31 23:15:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526457017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:50,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474059255] [2023-08-31 23:15:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:50,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:50,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-08-31 23:15:50,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:50,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-08-31 23:15:50,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:50,516 INFO L130 PetriNetUnfolder]: 381/716 cut-off events. [2023-08-31 23:15:50,516 INFO L131 PetriNetUnfolder]: For 573/573 co-relation queries the response was YES. [2023-08-31 23:15:50,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 716 events. 381/716 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3361 event pairs, 138 based on Foata normal form. 1/711 useless extension candidates. Maximal degree in co-relation 2031. Up to 382 conditions per place. [2023-08-31 23:15:50,521 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 53 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-08-31 23:15:50,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 362 flow [2023-08-31 23:15:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:15:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:15:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-31 23:15:50,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-31 23:15:50,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-31 23:15:50,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-31 23:15:50,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:50,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-31 23:15:50,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,527 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,527 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 138 flow. Second operand 4 states and 464 transitions. [2023-08-31 23:15:50,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 362 flow [2023-08-31 23:15:50,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 352 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:50,531 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 166 flow [2023-08-31 23:15:50,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-31 23:15:50,532 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-31 23:15:50,533 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 166 flow [2023-08-31 23:15:50,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:50,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:50,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:50,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:50,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:50,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:50,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1810643816, now seen corresponding path program 1 times [2023-08-31 23:15:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632193216] [2023-08-31 23:15:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:50,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:50,746 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:50,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:15:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:50,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:15:50,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:51,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:51,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632193216] [2023-08-31 23:15:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632193216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:51,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:51,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669015092] [2023-08-31 23:15:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:51,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:51,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 240 [2023-08-31 23:15:51,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:51,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:51,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 240 [2023-08-31 23:15:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:51,864 INFO L130 PetriNetUnfolder]: 321/618 cut-off events. [2023-08-31 23:15:51,864 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2023-08-31 23:15:51,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 618 events. 321/618 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2843 event pairs, 107 based on Foata normal form. 4/622 useless extension candidates. Maximal degree in co-relation 1775. Up to 536 conditions per place. [2023-08-31 23:15:51,868 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 31 selfloop transitions, 3 changer transitions 12/49 dead transitions. [2023-08-31 23:15:51,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 306 flow [2023-08-31 23:15:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-08-31 23:15:51,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2023-08-31 23:15:51,870 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-08-31 23:15:51,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-08-31 23:15:51,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:51,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-08-31 23:15:51,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:51,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:51,874 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:51,874 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 166 flow. Second operand 5 states and 513 transitions. [2023-08-31 23:15:51,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 306 flow [2023-08-31 23:15:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:15:51,879 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 128 flow [2023-08-31 23:15:51,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2023-08-31 23:15:51,879 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-31 23:15:51,880 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 128 flow [2023-08-31 23:15:51,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:51,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:51,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:51,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:52,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:52,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:52,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2059374017, now seen corresponding path program 3 times [2023-08-31 23:15:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205612731] [2023-08-31 23:15:52,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:15:52,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:52,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:52,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:15:52,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:15:52,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:15:52,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:15:52,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:52,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:52,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:52,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205612731] [2023-08-31 23:15:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205612731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039230829] [2023-08-31 23:15:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:52,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:52,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 240 [2023-08-31 23:15:52,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:52,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:52,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 240 [2023-08-31 23:15:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:52,460 INFO L130 PetriNetUnfolder]: 272/534 cut-off events. [2023-08-31 23:15:52,461 INFO L131 PetriNetUnfolder]: For 338/338 co-relation queries the response was YES. [2023-08-31 23:15:52,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 534 events. 272/534 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2279 event pairs, 69 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 1543. Up to 292 conditions per place. [2023-08-31 23:15:52,463 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 29 selfloop transitions, 1 changer transitions 24/56 dead transitions. [2023-08-31 23:15:52,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 350 flow [2023-08-31 23:15:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-08-31 23:15:52,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-08-31 23:15:52,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-08-31 23:15:52,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-08-31 23:15:52,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:52,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-08-31 23:15:52,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:52,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:52,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:52,470 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 128 flow. Second operand 5 states and 568 transitions. [2023-08-31 23:15:52,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 350 flow [2023-08-31 23:15:52,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 323 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-31 23:15:52,477 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 120 flow [2023-08-31 23:15:52,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-08-31 23:15:52,479 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-08-31 23:15:52,479 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 120 flow [2023-08-31 23:15:52,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:52,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:52,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:52,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:52,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:52,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:15:52,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash -711437397, now seen corresponding path program 4 times [2023-08-31 23:15:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616125325] [2023-08-31 23:15:52,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:15:52,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:52,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:52,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:15:52,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:15:52,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:15:52,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:15:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:15:53,001 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:15:53,002 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:15:53,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:15:53,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:15:53,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:15:53,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:15:53,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:15:53,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:15:53,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:15:53,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:15:53,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:15:53,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:15:53,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:15:53,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:15:53,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:15:53,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:53,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:53,217 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:53,222 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:15:53,222 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:15:53,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:15:53 BasicIcfg [2023-08-31 23:15:53,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:15:53,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:15:53,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:15:53,316 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:15:53,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:15:39" (3/4) ... [2023-08-31 23:15:53,318 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:15:53,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:15:53,320 INFO L158 Benchmark]: Toolchain (without parser) took 15730.79ms. Allocated memory was 73.4MB in the beginning and 218.1MB in the end (delta: 144.7MB). Free memory was 40.5MB in the beginning and 98.6MB in the end (delta: -58.1MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2023-08-31 23:15:53,320 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory is still 29.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:15:53,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.44ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 33.8MB in the end (delta: 6.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-08-31 23:15:53,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.81ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 31.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:53,321 INFO L158 Benchmark]: Boogie Preprocessor took 61.21ms. Allocated memory is still 73.4MB. Free memory was 31.2MB in the beginning and 29.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:53,321 INFO L158 Benchmark]: RCFGBuilder took 770.29ms. Allocated memory is still 73.4MB. Free memory was 29.1MB in the beginning and 32.3MB in the end (delta: -3.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-08-31 23:15:53,321 INFO L158 Benchmark]: TraceAbstraction took 14234.10ms. Allocated memory was 73.4MB in the beginning and 218.1MB in the end (delta: 144.7MB). Free memory was 31.9MB in the beginning and 99.7MB in the end (delta: -67.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2023-08-31 23:15:53,322 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 218.1MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:15:53,323 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.21ms. Allocated memory is still 52.4MB. Free memory is still 29.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.44ms. Allocated memory is still 73.4MB. Free memory was 40.3MB in the beginning and 33.8MB in the end (delta: 6.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.81ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 31.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.21ms. Allocated memory is still 73.4MB. Free memory was 31.2MB in the beginning and 29.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 770.29ms. Allocated memory is still 73.4MB. Free memory was 29.1MB in the beginning and 32.3MB in the end (delta: -3.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14234.10ms. Allocated memory was 73.4MB in the beginning and 218.1MB in the end (delta: 144.7MB). Free memory was 31.9MB in the beginning and 99.7MB in the end (delta: -67.8MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 218.1MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 130 PlacesBefore, 44 PlacesAfterwards, 122 TransitionsBefore, 35 TransitionsAfterwards, 2498 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 7376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3775, independent: 3557, independent conditional: 0, independent unconditional: 3557, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1360, independent: 1325, independent conditional: 0, independent unconditional: 1325, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3775, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 1360, unknown conditional: 0, unknown unconditional: 1360] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=0, t633={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=1, t633={-6:0}, t634={-10:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=2, t633={-6:0}, t634={-10:0}, t635={-2:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={-6:0}, t634={-10:0}, t635={-2:0}, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] 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, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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, 155 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: 14.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1165 IncrementalHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 19 mSDtfsCounter, 1165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=7, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 134 ConstructedInterpolants, 17 QuantifiedInterpolants, 1247 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1134 ConjunctsInSsa, 63 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-31 23:15:53,359 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