./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix052_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:57:59,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:57:59,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:57:59,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:57:59,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:57:59,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:57:59,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:57:59,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:57:59,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:57:59,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:57:59,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:57:59,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:57:59,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:57:59,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:57:59,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:57:59,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:57:59,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:57:59,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:57:59,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:57:59,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:57:59,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:57:59,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:57:59,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:57:59,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:57:59,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:57:59,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:57:59,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:57:59,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:57:59,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:57:59,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:57:59,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:57:59,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:57:59,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:57:59,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:57:59,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:57:59,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:57:59,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:57:59,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:57:59,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:57:59,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:57:59,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:57:59,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:57:59,323 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:57:59,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:57:59,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:57:59,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:57:59,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:57:59,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:57:59,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:57:59,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:57:59,327 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:57:59,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:57:59,328 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:57:59,328 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:57:59,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:57:59,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:57:59,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:57:59,328 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:57:59,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:57:59,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:57:59,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:57:59,329 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:57:59,329 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:57:59,329 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:57:59,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:57:59,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:57:59,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:57:59,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:57:59,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:57:59,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:57:59,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:57:59,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:57:59,331 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:57:59,331 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:57:59,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:57:59,332 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:57:59,332 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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 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 -> TOGETHER [2023-08-30 02:57:59,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:57:59,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:57:59,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:57:59,677 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:57:59,678 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:57:59,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-30 02:58:00,763 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:58:01,060 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:58:01,061 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-30 02:58:01,076 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea414b2e/cfd8fbbc019049afaa8e4ba98cbb6ff7/FLAGa9df6c6fd [2023-08-30 02:58:01,094 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea414b2e/cfd8fbbc019049afaa8e4ba98cbb6ff7 [2023-08-30 02:58:01,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:58:01,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:58:01,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:01,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:58:01,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:58:01,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aa3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01, skipping insertion in model container [2023-08-30 02:58:01,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:58:01,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:58:01,298 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/mix052_tso.oepc.i[949,962] [2023-08-30 02:58:01,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:01,532 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:58:01,542 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/mix052_tso.oepc.i[949,962] [2023-08-30 02:58:01,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:01,599 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:01,599 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:01,605 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:58:01,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01 WrapperNode [2023-08-30 02:58:01,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:01,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:01,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:58:01,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:58:01,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,651 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 02:58:01,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:01,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:58:01,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:58:01,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:58:01,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,700 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:58:01,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:58:01,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:58:01,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:58:01,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (1/1) ... [2023-08-30 02:58:01,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:58:01,758 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-30 02:58:01,786 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-30 02:58:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:58:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:58:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:58:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:58:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:58:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:58:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:58:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:58:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:58:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:58:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:58:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:58:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:58:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:58:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:58:01,809 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:58:02,019 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:58:02,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:58:02,338 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:58:02,517 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:58:02,517 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:58:02,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:02 BoogieIcfgContainer [2023-08-30 02:58:02,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:58:02,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:58:02,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:58:02,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:58:02,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:58:01" (1/3) ... [2023-08-30 02:58:02,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bf1ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:02, skipping insertion in model container [2023-08-30 02:58:02,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:01" (2/3) ... [2023-08-30 02:58:02,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bf1ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:02, skipping insertion in model container [2023-08-30 02:58:02,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:02" (3/3) ... [2023-08-30 02:58:02,526 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-08-30 02:58:02,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:58:02,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:58:02,542 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:58:02,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:58:02,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-30 02:58:02,683 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-30 02:58:02,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:02,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:58:02,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-30 02:58:02,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-30 02:58:02,700 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:58:02,719 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-30 02:58:02,725 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-30 02:58:02,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-30 02:58:02,763 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-30 02:58:02,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:02,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:58:02,766 INFO L119 LiptonReduction]: Number of co-enabled transitions 2126 [2023-08-30 02:58:06,663 INFO L134 LiptonReduction]: Checked pairs total: 5597 [2023-08-30 02:58:06,664 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 02:58:06,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:58:06,682 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;@2a782494, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:58:06,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:58:06,685 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:58:06,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:06,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:06,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:58:06,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:06,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash 514, now seen corresponding path program 1 times [2023-08-30 02:58:06,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:06,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729604980] [2023-08-30 02:58:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:06,797 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-30 02:58:06,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729604980] [2023-08-30 02:58:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729604980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:58:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298746682] [2023-08-30 02:58:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:06,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:58:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:06,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:58:06,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:58:06,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 228 [2023-08-30 02:58:06,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:06,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:06,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 228 [2023-08-30 02:58:06,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:07,154 INFO L130 PetriNetUnfolder]: 1277/1910 cut-off events. [2023-08-30 02:58:07,155 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 02:58:07,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1910 events. 1277/1910 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9026 event pairs, 1277 based on Foata normal form. 0/1610 useless extension candidates. Maximal degree in co-relation 3840. Up to 1887 conditions per place. [2023-08-30 02:58:07,173 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-30 02:58:07,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-30 02:58:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:58:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:58:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2023-08-30 02:58:07,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241228070175439 [2023-08-30 02:58:07,190 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 239 transitions. [2023-08-30 02:58:07,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 239 transitions. [2023-08-30 02:58:07,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:07,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 239 transitions. [2023-08-30 02:58:07,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 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-30 02:58:07,202 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 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-30 02:58:07,204 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 239 transitions. [2023-08-30 02:58:07,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-30 02:58:07,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:07,208 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-30 02:58:07,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 02:58:07,212 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-30 02:58:07,213 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-30 02:58:07,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:07,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:58:07,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:58:07,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:07,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 485244942, now seen corresponding path program 1 times [2023-08-30 02:58:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:07,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555413251] [2023-08-30 02:58:07,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:07,470 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-30 02:58:07,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:07,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555413251] [2023-08-30 02:58:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555413251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:07,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:07,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:58:07,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366754446] [2023-08-30 02:58:07,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:07,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:07,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 228 [2023-08-30 02:58:07,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:07,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 228 [2023-08-30 02:58:07,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:07,720 INFO L130 PetriNetUnfolder]: 999/1558 cut-off events. [2023-08-30 02:58:07,720 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 1558 events. 999/1558 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7496 event pairs, 277 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 3088. Up to 1195 conditions per place. [2023-08-30 02:58:07,728 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-30 02:58:07,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 154 flow [2023-08-30 02:58:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-30 02:58:07,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-30 02:58:07,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-30 02:58:07,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-30 02:58:07,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:07,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-30 02:58:07,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,741 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 348 transitions. [2023-08-30 02:58:07,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 154 flow [2023-08-30 02:58:07,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:07,742 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-30 02:58:07,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-30 02:58:07,743 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-30 02:58:07,744 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-30 02:58:07,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:07,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:07,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:07,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:58:07,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:07,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1276429954, now seen corresponding path program 1 times [2023-08-30 02:58:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466024199] [2023-08-30 02:58:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:08,322 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-30 02:58:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:08,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466024199] [2023-08-30 02:58:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466024199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:08,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:08,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908788732] [2023-08-30 02:58:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:08,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:08,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:08,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:08,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:08,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 228 [2023-08-30 02:58:08,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:08,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:08,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 228 [2023-08-30 02:58:08,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:08,638 INFO L130 PetriNetUnfolder]: 711/1091 cut-off events. [2023-08-30 02:58:08,639 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2023-08-30 02:58:08,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1091 events. 711/1091 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4843 event pairs, 200 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 2294. Up to 1032 conditions per place. [2023-08-30 02:58:08,646 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-08-30 02:58:08,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 130 flow [2023-08-30 02:58:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-08-30 02:58:08,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201754385964912 [2023-08-30 02:58:08,649 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-08-30 02:58:08,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-08-30 02:58:08,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:08,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-08-30 02:58:08,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:08,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:08,653 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:08,653 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 479 transitions. [2023-08-30 02:58:08,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 130 flow [2023-08-30 02:58:08,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:08,655 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 56 flow [2023-08-30 02:58:08,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-30 02:58:08,656 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-30 02:58:08,656 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 56 flow [2023-08-30 02:58:08,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:08,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:08,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:08,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:58:08,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:08,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1276430031, now seen corresponding path program 1 times [2023-08-30 02:58:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359707555] [2023-08-30 02:58:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:09,201 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-30 02:58:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359707555] [2023-08-30 02:58:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359707555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:09,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227902588] [2023-08-30 02:58:09,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:09,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:09,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:09,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2023-08-30 02:58:09,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:09,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:09,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2023-08-30 02:58:09,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:09,492 INFO L130 PetriNetUnfolder]: 995/1564 cut-off events. [2023-08-30 02:58:09,493 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-30 02:58:09,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3164 conditions, 1564 events. 995/1564 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7326 event pairs, 485 based on Foata normal form. 80/1641 useless extension candidates. Maximal degree in co-relation 3160. Up to 1297 conditions per place. [2023-08-30 02:58:09,501 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 27 selfloop transitions, 4 changer transitions 16/49 dead transitions. [2023-08-30 02:58:09,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 212 flow [2023-08-30 02:58:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-30 02:58:09,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48157894736842105 [2023-08-30 02:58:09,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-30 02:58:09,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-30 02:58:09,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:09,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-30 02:58:09,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:09,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:09,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:09,509 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 56 flow. Second operand 5 states and 549 transitions. [2023-08-30 02:58:09,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 212 flow [2023-08-30 02:58:09,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:09,511 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 87 flow [2023-08-30 02:58:09,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-30 02:58:09,512 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 02:58:09,512 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 87 flow [2023-08-30 02:58:09,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:09,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:09,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:09,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:58:09,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:09,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash -914645633, now seen corresponding path program 1 times [2023-08-30 02:58:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561548219] [2023-08-30 02:58:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:10,091 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-30 02:58:10,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:10,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561548219] [2023-08-30 02:58:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561548219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:10,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228715926] [2023-08-30 02:58:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:10,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:10,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2023-08-30 02:58:10,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 87 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:10,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:10,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2023-08-30 02:58:10,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:10,453 INFO L130 PetriNetUnfolder]: 1005/1588 cut-off events. [2023-08-30 02:58:10,454 INFO L131 PetriNetUnfolder]: For 878/889 co-relation queries the response was YES. [2023-08-30 02:58:10,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4072 conditions, 1588 events. 1005/1588 cut-off events. For 878/889 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7592 event pairs, 459 based on Foata normal form. 79/1665 useless extension candidates. Maximal degree in co-relation 4065. Up to 1227 conditions per place. [2023-08-30 02:58:10,463 INFO L137 encePairwiseOnDemand]: 220/228 looper letters, 35 selfloop transitions, 9 changer transitions 20/66 dead transitions. [2023-08-30 02:58:10,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 349 flow [2023-08-30 02:58:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 751 transitions. [2023-08-30 02:58:10,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4705513784461153 [2023-08-30 02:58:10,467 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 751 transitions. [2023-08-30 02:58:10,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 751 transitions. [2023-08-30 02:58:10,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:10,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 751 transitions. [2023-08-30 02:58:10,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:10,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:10,472 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:10,472 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 87 flow. Second operand 7 states and 751 transitions. [2023-08-30 02:58:10,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 349 flow [2023-08-30 02:58:10,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 343 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:10,479 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 162 flow [2023-08-30 02:58:10,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-30 02:58:10,480 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-30 02:58:10,480 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 162 flow [2023-08-30 02:58:10,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:10,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:10,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:10,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:58:10,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:10,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash -915683513, now seen corresponding path program 2 times [2023-08-30 02:58:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:10,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866487612] [2023-08-30 02:58:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:10,940 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-30 02:58:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866487612] [2023-08-30 02:58:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866487612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:10,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565938615] [2023-08-30 02:58:10,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:10,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:10,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:10,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 228 [2023-08-30 02:58:10,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:10,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:10,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 228 [2023-08-30 02:58:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:11,267 INFO L130 PetriNetUnfolder]: 954/1497 cut-off events. [2023-08-30 02:58:11,268 INFO L131 PetriNetUnfolder]: For 2697/2700 co-relation queries the response was YES. [2023-08-30 02:58:11,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1497 events. 954/1497 cut-off events. For 2697/2700 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6929 event pairs, 459 based on Foata normal form. 62/1553 useless extension candidates. Maximal degree in co-relation 4879. Up to 1241 conditions per place. [2023-08-30 02:58:11,279 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 34 selfloop transitions, 9 changer transitions 15/60 dead transitions. [2023-08-30 02:58:11,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 410 flow [2023-08-30 02:58:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-30 02:58:11,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47719298245614034 [2023-08-30 02:58:11,281 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-30 02:58:11,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-30 02:58:11,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:11,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-30 02:58:11,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:11,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:11,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:11,285 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 162 flow. Second operand 5 states and 544 transitions. [2023-08-30 02:58:11,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 410 flow [2023-08-30 02:58:11,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 388 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:11,295 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 225 flow [2023-08-30 02:58:11,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-30 02:58:11,296 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-30 02:58:11,296 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 225 flow [2023-08-30 02:58:11,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:11,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:11,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:11,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:58:11,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:11,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1912763767, now seen corresponding path program 1 times [2023-08-30 02:58:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964714340] [2023-08-30 02:58:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:11,759 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-30 02:58:11,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:11,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964714340] [2023-08-30 02:58:11,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964714340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:11,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:11,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99161553] [2023-08-30 02:58:11,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:11,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:11,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:11,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 228 [2023-08-30 02:58:11,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:11,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:11,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 228 [2023-08-30 02:58:11,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:12,308 INFO L130 PetriNetUnfolder]: 1542/2309 cut-off events. [2023-08-30 02:58:12,308 INFO L131 PetriNetUnfolder]: For 5135/5135 co-relation queries the response was YES. [2023-08-30 02:58:12,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8028 conditions, 2309 events. 1542/2309 cut-off events. For 5135/5135 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10190 event pairs, 383 based on Foata normal form. 78/2387 useless extension candidates. Maximal degree in co-relation 8015. Up to 1820 conditions per place. [2023-08-30 02:58:12,324 INFO L137 encePairwiseOnDemand]: 219/228 looper letters, 52 selfloop transitions, 12 changer transitions 23/87 dead transitions. [2023-08-30 02:58:12,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 627 flow [2023-08-30 02:58:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2023-08-30 02:58:12,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467418546365915 [2023-08-30 02:58:12,327 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2023-08-30 02:58:12,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2023-08-30 02:58:12,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:12,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2023-08-30 02:58:12,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:12,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:12,332 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:12,332 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 225 flow. Second operand 7 states and 713 transitions. [2023-08-30 02:58:12,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 87 transitions, 627 flow [2023-08-30 02:58:12,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 607 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:12,342 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 319 flow [2023-08-30 02:58:12,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 02:58:12,343 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-30 02:58:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 319 flow [2023-08-30 02:58:12,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:12,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:12,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:12,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:58:12,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:12,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1368662657, now seen corresponding path program 2 times [2023-08-30 02:58:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287916001] [2023-08-30 02:58:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:12,944 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-30 02:58:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287916001] [2023-08-30 02:58:12,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287916001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:12,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:12,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:12,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37173253] [2023-08-30 02:58:12,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:12,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:12,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:12,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:12,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 228 [2023-08-30 02:58:12,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:12,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:12,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 228 [2023-08-30 02:58:12,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:13,588 INFO L130 PetriNetUnfolder]: 1596/2388 cut-off events. [2023-08-30 02:58:13,588 INFO L131 PetriNetUnfolder]: For 7914/7914 co-relation queries the response was YES. [2023-08-30 02:58:13,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9557 conditions, 2388 events. 1596/2388 cut-off events. For 7914/7914 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10497 event pairs, 323 based on Foata normal form. 88/2476 useless extension candidates. Maximal degree in co-relation 9540. Up to 1761 conditions per place. [2023-08-30 02:58:13,606 INFO L137 encePairwiseOnDemand]: 218/228 looper letters, 64 selfloop transitions, 19 changer transitions 25/108 dead transitions. [2023-08-30 02:58:13,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 877 flow [2023-08-30 02:58:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:58:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:58:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 910 transitions. [2023-08-30 02:58:13,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44346978557504874 [2023-08-30 02:58:13,610 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 910 transitions. [2023-08-30 02:58:13,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 910 transitions. [2023-08-30 02:58:13,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:13,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 910 transitions. [2023-08-30 02:58:13,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.11111111111111) internal successors, (910), 9 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:13,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:13,616 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:13,616 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 319 flow. Second operand 9 states and 910 transitions. [2023-08-30 02:58:13,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 108 transitions, 877 flow [2023-08-30 02:58:13,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 108 transitions, 847 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:13,646 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 466 flow [2023-08-30 02:58:13,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=466, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-30 02:58:13,649 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-30 02:58:13,649 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 466 flow [2023-08-30 02:58:13,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:13,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:13,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:13,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:58:13,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:13,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash -934127613, now seen corresponding path program 1 times [2023-08-30 02:58:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317215588] [2023-08-30 02:58:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:14,068 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-30 02:58:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317215588] [2023-08-30 02:58:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317215588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:14,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341560956] [2023-08-30 02:58:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:14,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 228 [2023-08-30 02:58:14,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 466 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:14,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:14,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 228 [2023-08-30 02:58:14,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:14,560 INFO L130 PetriNetUnfolder]: 1421/2205 cut-off events. [2023-08-30 02:58:14,560 INFO L131 PetriNetUnfolder]: For 11929/12125 co-relation queries the response was YES. [2023-08-30 02:58:14,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10445 conditions, 2205 events. 1421/2205 cut-off events. For 11929/12125 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10473 event pairs, 313 based on Foata normal form. 70/2244 useless extension candidates. Maximal degree in co-relation 10425. Up to 1541 conditions per place. [2023-08-30 02:58:14,581 INFO L137 encePairwiseOnDemand]: 219/228 looper letters, 57 selfloop transitions, 23 changer transitions 13/100 dead transitions. [2023-08-30 02:58:14,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 984 flow [2023-08-30 02:58:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 745 transitions. [2023-08-30 02:58:14,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667919799498747 [2023-08-30 02:58:14,584 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 745 transitions. [2023-08-30 02:58:14,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 745 transitions. [2023-08-30 02:58:14,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:14,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 745 transitions. [2023-08-30 02:58:14,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:14,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:14,589 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:14,589 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 466 flow. Second operand 7 states and 745 transitions. [2023-08-30 02:58:14,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 984 flow [2023-08-30 02:58:14,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 915 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:14,611 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 619 flow [2023-08-30 02:58:14,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=619, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2023-08-30 02:58:14,612 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-30 02:58:14,612 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 619 flow [2023-08-30 02:58:14,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:14,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:14,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:14,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:58:14,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:14,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -867097863, now seen corresponding path program 2 times [2023-08-30 02:58:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825649999] [2023-08-30 02:58:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:15,276 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-30 02:58:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825649999] [2023-08-30 02:58:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825649999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58021510] [2023-08-30 02:58:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:15,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:15,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:15,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 228 [2023-08-30 02:58:15,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 619 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:15,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 228 [2023-08-30 02:58:15,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:15,914 INFO L130 PetriNetUnfolder]: 1678/2617 cut-off events. [2023-08-30 02:58:15,914 INFO L131 PetriNetUnfolder]: For 22663/22966 co-relation queries the response was YES. [2023-08-30 02:58:15,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13992 conditions, 2617 events. 1678/2617 cut-off events. For 22663/22966 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13036 event pairs, 300 based on Foata normal form. 139/2723 useless extension candidates. Maximal degree in co-relation 13970. Up to 1361 conditions per place. [2023-08-30 02:58:15,943 INFO L137 encePairwiseOnDemand]: 220/228 looper letters, 56 selfloop transitions, 24 changer transitions 19/106 dead transitions. [2023-08-30 02:58:15,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 106 transitions, 1165 flow [2023-08-30 02:58:15,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 738 transitions. [2023-08-30 02:58:15,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462406015037594 [2023-08-30 02:58:15,946 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 738 transitions. [2023-08-30 02:58:15,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 738 transitions. [2023-08-30 02:58:15,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:15,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 738 transitions. [2023-08-30 02:58:15,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.42857142857143) internal successors, (738), 7 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,951 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,951 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 619 flow. Second operand 7 states and 738 transitions. [2023-08-30 02:58:15,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 106 transitions, 1165 flow [2023-08-30 02:58:15,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 1070 flow, removed 42 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:15,992 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 715 flow [2023-08-30 02:58:15,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2023-08-30 02:58:15,993 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-30 02:58:15,994 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 715 flow [2023-08-30 02:58:15,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:15,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:15,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:15,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:58:15,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:15,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash 398734662, now seen corresponding path program 1 times [2023-08-30 02:58:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:15,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976398256] [2023-08-30 02:58:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:16,344 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-30 02:58:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:16,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976398256] [2023-08-30 02:58:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976398256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:16,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:16,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680557158] [2023-08-30 02:58:16,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:16,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:16,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 228 [2023-08-30 02:58:16,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 715 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:16,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 228 [2023-08-30 02:58:16,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:16,674 INFO L130 PetriNetUnfolder]: 987/1617 cut-off events. [2023-08-30 02:58:16,674 INFO L131 PetriNetUnfolder]: For 23900/24270 co-relation queries the response was YES. [2023-08-30 02:58:16,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9550 conditions, 1617 events. 987/1617 cut-off events. For 23900/24270 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8371 event pairs, 171 based on Foata normal form. 247/1800 useless extension candidates. Maximal degree in co-relation 9526. Up to 649 conditions per place. [2023-08-30 02:58:16,691 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 87 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2023-08-30 02:58:16,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 1333 flow [2023-08-30 02:58:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:58:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:58:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-30 02:58:16,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2023-08-30 02:58:16,694 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-30 02:58:16,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-30 02:58:16,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:16,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-30 02:58:16,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,697 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,697 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 715 flow. Second operand 4 states and 440 transitions. [2023-08-30 02:58:16,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 1333 flow [2023-08-30 02:58:16,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 105 transitions, 1269 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:16,724 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 636 flow [2023-08-30 02:58:16,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=636, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-30 02:58:16,725 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2023-08-30 02:58:16,725 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 636 flow [2023-08-30 02:58:16,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:16,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:16,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:16,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:58:16,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:16,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1691052115, now seen corresponding path program 1 times [2023-08-30 02:58:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878635006] [2023-08-30 02:58:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:17,002 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-30 02:58:17,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:17,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878635006] [2023-08-30 02:58:17,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878635006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:17,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:17,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110548784] [2023-08-30 02:58:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:17,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:17,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 228 [2023-08-30 02:58:17,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 636 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:17,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 228 [2023-08-30 02:58:17,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:17,290 INFO L130 PetriNetUnfolder]: 647/1122 cut-off events. [2023-08-30 02:58:17,290 INFO L131 PetriNetUnfolder]: For 13788/14041 co-relation queries the response was YES. [2023-08-30 02:58:17,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 1122 events. 647/1122 cut-off events. For 13788/14041 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5788 event pairs, 139 based on Foata normal form. 128/1238 useless extension candidates. Maximal degree in co-relation 6380. Up to 427 conditions per place. [2023-08-30 02:58:17,299 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 86 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-08-30 02:58:17,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 1277 flow [2023-08-30 02:58:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-08-30 02:58:17,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-30 02:58:17,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-08-30 02:58:17,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-08-30 02:58:17,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:17,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-08-30 02:58:17,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,305 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 636 flow. Second operand 5 states and 551 transitions. [2023-08-30 02:58:17,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 1277 flow [2023-08-30 02:58:17,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 1200 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-30 02:58:17,327 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 604 flow [2023-08-30 02:58:17,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=604, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-08-30 02:58:17,328 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-30 02:58:17,328 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 604 flow [2023-08-30 02:58:17,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:17,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:17,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:58:17,329 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:17,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -85275421, now seen corresponding path program 1 times [2023-08-30 02:58:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929752224] [2023-08-30 02:58:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:17,640 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-30 02:58:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:17,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929752224] [2023-08-30 02:58:17,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929752224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:17,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:17,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673198170] [2023-08-30 02:58:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:17,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:17,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 228 [2023-08-30 02:58:17,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:17,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 228 [2023-08-30 02:58:17,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:17,922 INFO L130 PetriNetUnfolder]: 608/1042 cut-off events. [2023-08-30 02:58:17,922 INFO L131 PetriNetUnfolder]: For 12124/12346 co-relation queries the response was YES. [2023-08-30 02:58:17,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 1042 events. 608/1042 cut-off events. For 12124/12346 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5410 event pairs, 129 based on Foata normal form. 68/1099 useless extension candidates. Maximal degree in co-relation 5993. Up to 427 conditions per place. [2023-08-30 02:58:17,929 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 72 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2023-08-30 02:58:17,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 1101 flow [2023-08-30 02:58:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-08-30 02:58:17,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692982456140351 [2023-08-30 02:58:17,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-08-30 02:58:17,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-08-30 02:58:17,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:17,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-08-30 02:58:17,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,937 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,937 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 604 flow. Second operand 6 states and 642 transitions. [2023-08-30 02:58:17,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 1101 flow [2023-08-30 02:58:17,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 95 transitions, 1017 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:17,957 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 578 flow [2023-08-30 02:58:17,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2023-08-30 02:58:17,958 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-30 02:58:17,958 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 578 flow [2023-08-30 02:58:17,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:17,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:17,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:17,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:58:17,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:17,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1489078365, now seen corresponding path program 1 times [2023-08-30 02:58:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221652045] [2023-08-30 02:58:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:18,331 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-30 02:58:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221652045] [2023-08-30 02:58:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221652045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:18,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:18,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585871603] [2023-08-30 02:58:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:18,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:18,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:18,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 228 [2023-08-30 02:58:18,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:18,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:18,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 228 [2023-08-30 02:58:18,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:18,813 INFO L130 PetriNetUnfolder]: 1140/1920 cut-off events. [2023-08-30 02:58:18,813 INFO L131 PetriNetUnfolder]: For 14964/15065 co-relation queries the response was YES. [2023-08-30 02:58:18,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10664 conditions, 1920 events. 1140/1920 cut-off events. For 14964/15065 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10419 event pairs, 134 based on Foata normal form. 51/1966 useless extension candidates. Maximal degree in co-relation 10641. Up to 1024 conditions per place. [2023-08-30 02:58:18,825 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 66 selfloop transitions, 4 changer transitions 67/142 dead transitions. [2023-08-30 02:58:18,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 142 transitions, 1521 flow [2023-08-30 02:58:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2023-08-30 02:58:18,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43796992481203006 [2023-08-30 02:58:18,828 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2023-08-30 02:58:18,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2023-08-30 02:58:18,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:18,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2023-08-30 02:58:18,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:18,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:18,833 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:18,833 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 578 flow. Second operand 7 states and 699 transitions. [2023-08-30 02:58:18,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 142 transitions, 1521 flow [2023-08-30 02:58:18,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 142 transitions, 1391 flow, removed 51 selfloop flow, removed 7 redundant places. [2023-08-30 02:58:18,875 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 488 flow [2023-08-30 02:58:18,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=488, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-08-30 02:58:18,876 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-08-30 02:58:18,876 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 488 flow [2023-08-30 02:58:18,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:18,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:18,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:18,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:58:18,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:18,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1943873039, now seen corresponding path program 2 times [2023-08-30 02:58:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350011515] [2023-08-30 02:58:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:19,258 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-30 02:58:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350011515] [2023-08-30 02:58:19,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350011515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:19,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485022350] [2023-08-30 02:58:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:19,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:19,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:19,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 228 [2023-08-30 02:58:19,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:19,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 228 [2023-08-30 02:58:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:19,659 INFO L130 PetriNetUnfolder]: 811/1407 cut-off events. [2023-08-30 02:58:19,659 INFO L131 PetriNetUnfolder]: For 7245/7334 co-relation queries the response was YES. [2023-08-30 02:58:19,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7014 conditions, 1407 events. 811/1407 cut-off events. For 7245/7334 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7678 event pairs, 111 based on Foata normal form. 44/1442 useless extension candidates. Maximal degree in co-relation 6991. Up to 640 conditions per place. [2023-08-30 02:58:19,667 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 33 selfloop transitions, 3 changer transitions 64/102 dead transitions. [2023-08-30 02:58:19,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 1041 flow [2023-08-30 02:58:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-30 02:58:19,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4291979949874687 [2023-08-30 02:58:19,670 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-30 02:58:19,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-30 02:58:19,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:19,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-30 02:58:19,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,675 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,675 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 488 flow. Second operand 7 states and 685 transitions. [2023-08-30 02:58:19,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 1041 flow [2023-08-30 02:58:19,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 941 flow, removed 18 selfloop flow, removed 11 redundant places. [2023-08-30 02:58:19,690 INFO L231 Difference]: Finished difference. Result has 71 places, 34 transitions, 253 flow [2023-08-30 02:58:19,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=71, PETRI_TRANSITIONS=34} [2023-08-30 02:58:19,691 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-30 02:58:19,691 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 34 transitions, 253 flow [2023-08-30 02:58:19,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:19,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:19,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:19,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:58:19,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:19,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2030309945, now seen corresponding path program 3 times [2023-08-30 02:58:19,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:19,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478000266] [2023-08-30 02:58:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:19,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:19,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:58:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:19,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:58:19,828 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:58:19,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:58:19,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:58:19,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:58:19,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:58:19,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:58:19,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:58:19,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:58:19,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:58:19,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:58:19,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:58:19,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:58:19,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:58:19,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:58:19,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:58:19,833 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:19,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:58:19,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:58:19,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:58:19 BasicIcfg [2023-08-30 02:58:19,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:58:19,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:58:19,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:58:19,921 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:58:19,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:02" (3/4) ... [2023-08-30 02:58:19,923 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:58:19,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:58:19,924 INFO L158 Benchmark]: Toolchain (without parser) took 18827.45ms. Allocated memory was 67.1MB in the beginning and 421.5MB in the end (delta: 354.4MB). Free memory was 42.9MB in the beginning and 174.5MB in the end (delta: -131.6MB). Peak memory consumption was 224.8MB. Max. memory is 16.1GB. [2023-08-30 02:58:19,924 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory was 30.7MB in the beginning and 30.6MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:19,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.14ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 34.9MB in the end (delta: 7.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 02:58:19,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.00ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 32.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:58:19,925 INFO L158 Benchmark]: Boogie Preprocessor took 59.35ms. Allocated memory is still 67.1MB. Free memory was 32.0MB in the beginning and 30.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:19,926 INFO L158 Benchmark]: RCFGBuilder took 807.17ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 30.2MB in the beginning and 46.9MB in the end (delta: -16.7MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2023-08-30 02:58:19,926 INFO L158 Benchmark]: TraceAbstraction took 17399.33ms. Allocated memory was 83.9MB in the beginning and 421.5MB in the end (delta: 337.6MB). Free memory was 46.2MB in the beginning and 174.5MB in the end (delta: -128.3MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. [2023-08-30 02:58:19,926 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 421.5MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:19,927 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 was 30.7MB in the beginning and 30.6MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.14ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 34.9MB in the end (delta: 7.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.00ms. Allocated memory is still 67.1MB. Free memory was 34.9MB in the beginning and 32.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.35ms. Allocated memory is still 67.1MB. Free memory was 32.0MB in the beginning and 30.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 807.17ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 30.2MB in the beginning and 46.9MB in the end (delta: -16.7MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17399.33ms. Allocated memory was 83.9MB in the beginning and 421.5MB in the end (delta: 337.6MB). Free memory was 46.2MB in the beginning and 174.5MB in the end (delta: -128.3MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 421.5MB. Free memory is still 174.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 123 PlacesBefore, 41 PlacesAfterwards, 115 TransitionsBefore, 32 TransitionsAfterwards, 2126 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 5597 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2596, independent: 2438, independent conditional: 0, independent unconditional: 2438, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1139, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2596, independent: 1336, independent conditional: 0, independent unconditional: 1336, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1139, unknown conditional: 0, unknown unconditional: 1139] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-1, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=0, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=1, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 738 mSDsluCounter, 609 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1925 IncrementalHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 164 mSDtfsCounter, 1925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=10, InterpolantAutomatonStates: 86, 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, 5.7s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 2260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-30 02:58:19,963 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/mix052_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:58:21,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:58:21,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:58:21,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:58:21,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:58:21,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:58:21,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:58:21,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:58:21,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:58:21,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:58:21,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:58:21,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:58:21,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:58:21,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:58:21,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:58:21,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:58:21,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:58:21,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:58:21,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:58:21,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:58:21,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:58:21,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:58:21,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:58:21,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:58:21,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:58:21,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:58:21,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:58:21,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:58:21,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:58:21,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:58:21,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:58:21,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:58:21,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:58:21,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:58:21,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:58:21,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:58:21,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:58:21,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:58:21,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:58:21,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:58:22,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:58:22,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:58:22,046 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:58:22,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:58:22,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:58:22,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:58:22,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:58:22,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:58:22,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:58:22,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:58:22,050 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:58:22,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:58:22,051 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:58:22,051 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:58:22,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:58:22,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:58:22,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:58:22,051 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:58:22,052 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:58:22,052 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:58:22,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:58:22,052 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:58:22,052 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:58:22,052 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:58:22,053 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:58:22,053 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:58:22,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:58:22,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:58:22,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:58:22,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:22,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:58:22,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:58:22,054 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:58:22,054 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:58:22,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:58:22,054 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:58:22,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:58:22,055 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:58:22,055 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:58:22,055 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 -> 2b7b455ef4c5fa587af8d02bd246c19891a72a51abfbb562aebbb342c1c7fae8 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 -> TOGETHER [2023-08-30 02:58:22,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:58:22,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:58:22,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:58:22,404 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:58:22,405 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:58:22,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-30 02:58:23,687 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:58:23,956 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:58:23,956 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2023-08-30 02:58:23,969 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f3ac7b1/6d46528c0e004f5090c9c9ba09615f25/FLAG88433f0cc [2023-08-30 02:58:23,981 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8f3ac7b1/6d46528c0e004f5090c9c9ba09615f25 [2023-08-30 02:58:23,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:58:23,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:58:23,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:23,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:58:23,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:58:23,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:23" (1/1) ... [2023-08-30 02:58:23,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d90222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:23, skipping insertion in model container [2023-08-30 02:58:23,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:23" (1/1) ... [2023-08-30 02:58:23,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:58:24,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:58:24,167 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/mix052_tso.oepc.i[949,962] [2023-08-30 02:58:24,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:24,406 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:58:24,418 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/mix052_tso.oepc.i[949,962] [2023-08-30 02:58:24,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:24,529 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:24,529 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:24,535 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:58:24,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24 WrapperNode [2023-08-30 02:58:24,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:24,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:24,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:58:24,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:58:24,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,617 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 02:58:24,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:24,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:58:24,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:58:24,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:58:24,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:58:24,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:58:24,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:58:24,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:58:24,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:58:24,700 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-30 02:58:24,725 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-30 02:58:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:58:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:58:24,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:58:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:58:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:58:24,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:58:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:58:24,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:58:24,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:58:24,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:58:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:58:24,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:58:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:58:24,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:58:24,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:58:24,752 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:58:24,875 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:58:24,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:58:25,326 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:58:25,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:58:25,503 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:58:25,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:25 BoogieIcfgContainer [2023-08-30 02:58:25,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:58:25,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:58:25,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:58:25,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:58:25,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:58:23" (1/3) ... [2023-08-30 02:58:25,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644b8972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:25, skipping insertion in model container [2023-08-30 02:58:25,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (2/3) ... [2023-08-30 02:58:25,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644b8972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:25, skipping insertion in model container [2023-08-30 02:58:25,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:25" (3/3) ... [2023-08-30 02:58:25,513 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2023-08-30 02:58:25,528 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:58:25,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 02:58:25,529 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:58:25,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:58:25,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-30 02:58:25,686 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-30 02:58:25,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:25,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:58:25,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-30 02:58:25,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-30 02:58:25,701 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:58:25,720 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-30 02:58:25,723 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-30 02:58:25,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-30 02:58:25,758 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-30 02:58:25,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:25,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 02:58:25,760 INFO L119 LiptonReduction]: Number of co-enabled transitions 2126 [2023-08-30 02:58:31,788 INFO L134 LiptonReduction]: Checked pairs total: 6117 [2023-08-30 02:58:31,788 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 02:58:31,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:58:31,805 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;@6df642ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:58:31,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 02:58:31,807 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:58:31,807 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:31,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:31,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:58:31,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:31,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash 517, now seen corresponding path program 1 times [2023-08-30 02:58:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991569668] [2023-08-30 02:58:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:31,824 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-30 02:58:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:31,829 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-30 02:58:31,831 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-30 02:58:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:31,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:58:31,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:31,900 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-30 02:58:31,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:31,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:31,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991569668] [2023-08-30 02:58:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991569668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:31,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:31,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:58:31,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395777904] [2023-08-30 02:58:31,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:31,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:58:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:58:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:58:31,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-30 02:58:31,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:31,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:31,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-30 02:58:31,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:32,454 INFO L130 PetriNetUnfolder]: 1277/1907 cut-off events. [2023-08-30 02:58:32,454 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-30 02:58:32,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 1907 events. 1277/1907 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9001 event pairs, 1277 based on Foata normal form. 0/1603 useless extension candidates. Maximal degree in co-relation 3837. Up to 1887 conditions per place. [2023-08-30 02:58:32,473 INFO L137 encePairwiseOnDemand]: 224/231 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-30 02:58:32,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-30 02:58:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:58:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:58:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 241 transitions. [2023-08-30 02:58:32,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216450216450217 [2023-08-30 02:58:32,490 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 241 transitions. [2023-08-30 02:58:32,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 241 transitions. [2023-08-30 02:58:32,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:32,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 241 transitions. [2023-08-30 02:58:32,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:32,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:32,507 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:32,509 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 241 transitions. [2023-08-30 02:58:32,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-30 02:58:32,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:32,514 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-30 02:58:32,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-30 02:58:32,519 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-30 02:58:32,519 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-30 02:58:32,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:32,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:32,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:58:32,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:32,730 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-30 02:58:32,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:32,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash 490842829, now seen corresponding path program 1 times [2023-08-30 02:58:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058522681] [2023-08-30 02:58:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:32,732 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-30 02:58:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:32,734 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-30 02:58:32,736 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-30 02:58:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:32,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:32,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:32,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:32,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058522681] [2023-08-30 02:58:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058522681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:32,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:58:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916404284] [2023-08-30 02:58:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:32,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 231 [2023-08-30 02:58:32,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:32,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:32,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 231 [2023-08-30 02:58:32,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:33,097 INFO L130 PetriNetUnfolder]: 999/1614 cut-off events. [2023-08-30 02:58:33,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:33,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1614 events. 999/1614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8660 event pairs, 165 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 3144. Up to 1195 conditions per place. [2023-08-30 02:58:33,106 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-30 02:58:33,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 154 flow [2023-08-30 02:58:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-30 02:58:33,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064935064935064 [2023-08-30 02:58:33,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-30 02:58:33,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-30 02:58:33,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:33,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-30 02:58:33,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,114 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 351 transitions. [2023-08-30 02:58:33,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 154 flow [2023-08-30 02:58:33,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:33,115 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-30 02:58:33,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-30 02:58:33,116 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-30 02:58:33,116 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-30 02:58:33,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:33,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:33,131 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-30 02:58:33,332 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-30 02:58:33,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:33,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -731650327, now seen corresponding path program 1 times [2023-08-30 02:58:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298746817] [2023-08-30 02:58:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:33,334 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-30 02:58:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:33,336 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-30 02:58:33,357 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-30 02:58:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:33,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:58:33,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:33,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:33,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298746817] [2023-08-30 02:58:33,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298746817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:33,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:33,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989449425] [2023-08-30 02:58:33,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:33,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:33,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:33,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:33,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 231 [2023-08-30 02:58:33,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 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-30 02:58:33,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:33,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 231 [2023-08-30 02:58:33,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:33,714 INFO L130 PetriNetUnfolder]: 557/925 cut-off events. [2023-08-30 02:58:33,715 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-30 02:58:33,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 925 events. 557/925 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4435 event pairs, 112 based on Foata normal form. 64/938 useless extension candidates. Maximal degree in co-relation 1954. Up to 501 conditions per place. [2023-08-30 02:58:33,720 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 37 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2023-08-30 02:58:33,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 196 flow [2023-08-30 02:58:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:58:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:58:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-08-30 02:58:33,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816017316017316 [2023-08-30 02:58:33,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-08-30 02:58:33,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-08-30 02:58:33,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:33,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-08-30 02:58:33,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-30 02:58:33,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,728 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 4 states and 445 transitions. [2023-08-30 02:58:33,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 196 flow [2023-08-30 02:58:33,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:33,730 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 86 flow [2023-08-30 02:58:33,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-30 02:58:33,731 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2023-08-30 02:58:33,732 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 86 flow [2023-08-30 02:58:33,732 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-30 02:58:33,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:33,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:33,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:33,942 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-30 02:58:33,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:33,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash 402688418, now seen corresponding path program 1 times [2023-08-30 02:58:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322168991] [2023-08-30 02:58:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:33,944 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-30 02:58:33,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:33,945 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-30 02:58:33,948 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-30 02:58:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:34,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:34,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:34,075 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-30 02:58:34,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:34,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322168991] [2023-08-30 02:58:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322168991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:34,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:34,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211000168] [2023-08-30 02:58:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:34,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:34,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 231 [2023-08-30 02:58:34,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 86 flow. Second operand has 5 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-30 02:58:34,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:34,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 231 [2023-08-30 02:58:34,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:34,278 INFO L130 PetriNetUnfolder]: 233/439 cut-off events. [2023-08-30 02:58:34,278 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-08-30 02:58:34,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 439 events. 233/439 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1882 event pairs, 56 based on Foata normal form. 37/461 useless extension candidates. Maximal degree in co-relation 1144. Up to 162 conditions per place. [2023-08-30 02:58:34,281 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 45 selfloop transitions, 8 changer transitions 1/57 dead transitions. [2023-08-30 02:58:34,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 277 flow [2023-08-30 02:58:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-08-30 02:58:34,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48138528138528136 [2023-08-30 02:58:34,284 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-08-30 02:58:34,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-08-30 02:58:34,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:34,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-08-30 02:58:34,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,288 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,289 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 86 flow. Second operand 5 states and 556 transitions. [2023-08-30 02:58:34,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 277 flow [2023-08-30 02:58:34,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 267 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:34,291 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 126 flow [2023-08-30 02:58:34,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-30 02:58:34,292 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-30 02:58:34,292 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 126 flow [2023-08-30 02:58:34,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-30 02:58:34,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:34,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:34,305 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-30 02:58:34,502 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-30 02:58:34,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:34,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1602675210, now seen corresponding path program 1 times [2023-08-30 02:58:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973977097] [2023-08-30 02:58:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:34,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:58:34,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:34,505 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-30 02:58:34,508 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-30 02:58:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:58:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:34,677 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-30 02:58:34,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:34,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:34,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973977097] [2023-08-30 02:58:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973977097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727896006] [2023-08-30 02:58:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:34,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 231 [2023-08-30 02:58:34,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:34,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 231 [2023-08-30 02:58:34,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:34,903 INFO L130 PetriNetUnfolder]: 143/277 cut-off events. [2023-08-30 02:58:34,904 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2023-08-30 02:58:34,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 277 events. 143/277 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1064 event pairs, 56 based on Foata normal form. 10/281 useless extension candidates. Maximal degree in co-relation 808. Up to 108 conditions per place. [2023-08-30 02:58:34,906 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 33 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2023-08-30 02:58:34,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 264 flow [2023-08-30 02:58:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-30 02:58:34,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668109668109668 [2023-08-30 02:58:34,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-30 02:58:34,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-30 02:58:34,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:34,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-30 02:58:34,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,916 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,916 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 126 flow. Second operand 6 states and 647 transitions. [2023-08-30 02:58:34,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 264 flow [2023-08-30 02:58:34,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 239 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:34,920 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 140 flow [2023-08-30 02:58:34,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-30 02:58:34,920 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-30 02:58:34,921 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 140 flow [2023-08-30 02:58:34,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:34,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:34,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:34,932 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-30 02:58:35,131 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-30 02:58:35,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:35,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash 425488677, now seen corresponding path program 1 times [2023-08-30 02:58:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621856648] [2023-08-30 02:58:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:35,133 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-30 02:58:35,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:35,134 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-30 02:58:35,135 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-30 02:58:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:35,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:58:35,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:35,640 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-30 02:58:35,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:35,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621856648] [2023-08-30 02:58:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621856648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:35,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:35,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170946298] [2023-08-30 02:58:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:35,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:35,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:35,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:35,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 231 [2023-08-30 02:58:35,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:35,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:35,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 231 [2023-08-30 02:58:35,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:36,011 INFO L130 PetriNetUnfolder]: 135/263 cut-off events. [2023-08-30 02:58:36,011 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2023-08-30 02:58:36,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 263 events. 135/263 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1027 event pairs, 7 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 758. Up to 204 conditions per place. [2023-08-30 02:58:36,013 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-30 02:58:36,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 262 flow [2023-08-30 02:58:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2023-08-30 02:58:36,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147186147186147 [2023-08-30 02:58:36,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 479 transitions. [2023-08-30 02:58:36,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 479 transitions. [2023-08-30 02:58:36,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:36,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 479 transitions. [2023-08-30 02:58:36,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,027 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 140 flow. Second operand 5 states and 479 transitions. [2023-08-30 02:58:36,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 262 flow [2023-08-30 02:58:36,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 184 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-30 02:58:36,033 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 86 flow [2023-08-30 02:58:36,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-30 02:58:36,036 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-30 02:58:36,036 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 86 flow [2023-08-30 02:58:36,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:36,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:36,049 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-30 02:58:36,247 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-30 02:58:36,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:36,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1705116193, now seen corresponding path program 1 times [2023-08-30 02:58:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046657392] [2023-08-30 02:58:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:36,249 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-30 02:58:36,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:36,250 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-30 02:58:36,251 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-30 02:58:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:36,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:36,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:36,710 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-30 02:58:36,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:36,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046657392] [2023-08-30 02:58:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046657392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315406518] [2023-08-30 02:58:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:36,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:36,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 02:58:36,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:36,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 02:58:36,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:36,897 INFO L130 PetriNetUnfolder]: 198/379 cut-off events. [2023-08-30 02:58:36,897 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-08-30 02:58:36,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 379 events. 198/379 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1580 event pairs, 38 based on Foata normal form. 1/379 useless extension candidates. Maximal degree in co-relation 896. Up to 223 conditions per place. [2023-08-30 02:58:36,899 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 32 selfloop transitions, 1 changer transitions 22/57 dead transitions. [2023-08-30 02:58:36,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 57 transitions, 287 flow [2023-08-30 02:58:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-08-30 02:58:36,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649350649350649 [2023-08-30 02:58:36,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-08-30 02:58:36,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-08-30 02:58:36,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:36,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-08-30 02:58:36,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,906 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,906 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 86 flow. Second operand 5 states and 537 transitions. [2023-08-30 02:58:36,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 57 transitions, 287 flow [2023-08-30 02:58:36,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 279 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:36,908 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 90 flow [2023-08-30 02:58:36,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 02:58:36,908 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-30 02:58:36,908 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 90 flow [2023-08-30 02:58:36,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:36,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:36,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:36,923 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-30 02:58:37,120 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-30 02:58:37,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:37,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash -170220773, now seen corresponding path program 2 times [2023-08-30 02:58:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:37,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492003052] [2023-08-30 02:58:37,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:58:37,121 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-30 02:58:37,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:37,122 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-30 02:58:37,127 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-30 02:58:37,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:58:37,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:58:37,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:58:37,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:37,286 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-30 02:58:37,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:37,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492003052] [2023-08-30 02:58:37,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492003052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:37,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:37,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175882102] [2023-08-30 02:58:37,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:37,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:37,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:37,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 231 [2023-08-30 02:58:37,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:37,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 231 [2023-08-30 02:58:37,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:37,469 INFO L130 PetriNetUnfolder]: 230/438 cut-off events. [2023-08-30 02:58:37,469 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2023-08-30 02:58:37,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 438 events. 230/438 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1873 event pairs, 102 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 1095. Up to 169 conditions per place. [2023-08-30 02:58:37,471 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 27 selfloop transitions, 1 changer transitions 23/53 dead transitions. [2023-08-30 02:58:37,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 276 flow [2023-08-30 02:58:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2023-08-30 02:58:37,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614718614718615 [2023-08-30 02:58:37,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2023-08-30 02:58:37,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2023-08-30 02:58:37,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:37,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2023-08-30 02:58:37,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,478 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,478 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 90 flow. Second operand 5 states and 533 transitions. [2023-08-30 02:58:37,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 276 flow [2023-08-30 02:58:37,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 267 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:37,480 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 94 flow [2023-08-30 02:58:37,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-30 02:58:37,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-30 02:58:37,483 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 94 flow [2023-08-30 02:58:37,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:37,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:37,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 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:58:37,693 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-30 02:58:37,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:37,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash 898362897, now seen corresponding path program 3 times [2023-08-30 02:58:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936675510] [2023-08-30 02:58:37,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:58:37,695 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-30 02:58:37,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:37,696 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-30 02:58:37,698 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-30 02:58:37,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:58:37,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:58:37,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 02:58:37,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:58:38,191 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-30 02:58:38,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:58:38,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:58:38,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936675510] [2023-08-30 02:58:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936675510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 02:58:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909083250] [2023-08-30 02:58:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:38,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:58:38,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:58:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:58:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:58:38,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 231 [2023-08-30 02:58:38,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 94 flow. Second operand has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:38,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 231 [2023-08-30 02:58:38,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:38,553 INFO L130 PetriNetUnfolder]: 236/469 cut-off events. [2023-08-30 02:58:38,553 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-30 02:58:38,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 469 events. 236/469 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2075 event pairs, 58 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1205. Up to 189 conditions per place. [2023-08-30 02:58:38,555 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 31 selfloop transitions, 3 changer transitions 23/59 dead transitions. [2023-08-30 02:58:38,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 312 flow [2023-08-30 02:58:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 632 transitions. [2023-08-30 02:58:38,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455988455988456 [2023-08-30 02:58:38,557 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 632 transitions. [2023-08-30 02:58:38,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 632 transitions. [2023-08-30 02:58:38,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:38,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 632 transitions. [2023-08-30 02:58:38,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,562 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,562 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 94 flow. Second operand 6 states and 632 transitions. [2023-08-30 02:58:38,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 312 flow [2023-08-30 02:58:38,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 303 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:38,564 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 104 flow [2023-08-30 02:58:38,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-30 02:58:38,565 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-08-30 02:58:38,565 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 104 flow [2023-08-30 02:58:38,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.0) internal successors, (1000), 10 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:38,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:38,582 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-30 02:58:38,776 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-30 02:58:38,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 02:58:38,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1002999911, now seen corresponding path program 4 times [2023-08-30 02:58:38,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:58:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183440739] [2023-08-30 02:58:38,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:58:38,777 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-30 02:58:38,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:58:38,779 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-30 02:58:38,819 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-30 02:58:38,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:58:38,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:58:38,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:58:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:58:39,048 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:58:39,048 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:58:39,049 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 02:58:39,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 02:58:39,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 02:58:39,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 02:58:39,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 02:58:39,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 02:58:39,087 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-30 02:58:39,252 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-30 02:58:39,253 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:39,257 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:58:39,257 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:58:39,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:58:39 BasicIcfg [2023-08-30 02:58:39,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:58:39,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:58:39,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:58:39,334 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:58:39,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:25" (3/4) ... [2023-08-30 02:58:39,336 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:58:39,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:58:39,337 INFO L158 Benchmark]: Toolchain (without parser) took 15351.45ms. Allocated memory was 73.4MB in the beginning and 146.8MB in the end (delta: 73.4MB). Free memory was 50.5MB in the beginning and 79.1MB in the end (delta: -28.6MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:39,337 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:39,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.75ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 50.3MB in the beginning and 77.7MB in the end (delta: -27.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2023-08-30 02:58:39,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.13ms. Allocated memory is still 100.7MB. Free memory was 77.7MB in the beginning and 74.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:58:39,339 INFO L158 Benchmark]: Boogie Preprocessor took 47.87ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:39,339 INFO L158 Benchmark]: RCFGBuilder took 837.25ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2023-08-30 02:58:39,340 INFO L158 Benchmark]: TraceAbstraction took 13825.35ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 70.1MB in the beginning and 79.1MB in the end (delta: -9.0MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2023-08-30 02:58:39,340 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 146.8MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:58:39,342 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.24ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.75ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 50.3MB in the beginning and 77.7MB in the end (delta: -27.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.13ms. Allocated memory is still 100.7MB. Free memory was 77.7MB in the beginning and 74.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.87ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 72.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 837.25ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13825.35ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 70.1MB in the beginning and 79.1MB in the end (delta: -9.0MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 146.8MB. Free memory is still 79.1MB. 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.1s, 124 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 32 TransitionsAfterwards, 2126 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 6117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2765, independent: 2581, independent conditional: 0, independent unconditional: 2581, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1140, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2765, independent: 1479, independent conditional: 0, independent unconditional: 1479, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1140, unknown conditional: 0, unknown unconditional: 1140] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=0, t1403={-6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=1, t1403={-6:0}, t1404={-10:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=2, t1403={-6:0}, t1404={-10:0}, t1405={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={-6:0}, t1404={-10:0}, t1405={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403={-6:0}, t1404={-10:0}, t1405={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1165 IncrementalHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 16 mSDtfsCounter, 1165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 41, 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.4s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 11 QuantifiedInterpolants, 1207 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1150 ConjunctsInSsa, 70 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-30 02:58:39,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample