./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:30:24,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:30:24,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:30:24,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:30:24,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:30:24,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:30:24,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:30:24,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:30:24,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:30:24,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:30:24,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:30:24,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:30:24,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:30:24,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:30:24,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:30:24,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:30:24,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:30:24,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:30:24,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:30:24,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:30:24,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:30:24,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:30:24,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:30:24,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:30:24,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:30:24,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:30:24,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:30:24,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:30:24,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:30:24,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:30:24,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:30:24,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:30:24,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:30:24,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:30:24,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:30:24,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:30:24,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:30:24,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:30:24,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:30:24,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:30:24,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:30:24,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:30:24,539 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:30:24,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:30:24,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:30:24,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:30:24,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:30:24,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:30:24,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:30:24,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:30:24,542 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:30:24,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:30:24,543 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:30:24,544 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:30:24,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:30:24,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:30:24,544 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:30:24,544 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:30:24,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:30:24,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:30:24,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:30:24,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:24,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:30:24,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:30:24,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:30:24,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:30:24,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:30:24,546 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:30:24,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:30:24,546 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:30:24,546 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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:30:24,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:30:24,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:30:24,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:30:24,786 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:30:24,786 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:30:24,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-29 20:30:25,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:30:26,002 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:30:26,002 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-29 20:30:26,013 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76616c1b2/d105f35f07324c2aa9a16f2c557813ad/FLAG5e6b42f9c [2023-08-29 20:30:26,023 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76616c1b2/d105f35f07324c2aa9a16f2c557813ad [2023-08-29 20:30:26,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:30:26,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:30:26,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:26,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:30:26,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:30:26,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fb479e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26, skipping insertion in model container [2023-08-29 20:30:26,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:30:26,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:30:26,184 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/mix055.opt.i[944,957] [2023-08-29 20:30:26,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:26,371 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:30:26,381 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/mix055.opt.i[944,957] [2023-08-29 20:30:26,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:26,466 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:26,467 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:26,471 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:30:26,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26 WrapperNode [2023-08-29 20:30:26,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:26,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:26,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:30:26,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:30:26,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,510 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-29 20:30:26,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:26,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:30:26,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:30:26,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:30:26,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:30:26,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:30:26,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:30:26,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:30:26,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (1/1) ... [2023-08-29 20:30:26,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:26,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:30:26,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:30:26,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:30:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:30:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:30:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:30:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:30:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:30:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:30:26,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:30:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:30:26,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:30:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:30:26,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:30:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:30:26,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:30:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:30:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:30:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:30:26,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:30:26,660 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:30:26,836 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:30:26,837 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:30:27,062 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:30:27,135 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:30:27,136 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:30:27,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:27 BoogieIcfgContainer [2023-08-29 20:30:27,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:30:27,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:30:27,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:30:27,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:30:27,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:30:26" (1/3) ... [2023-08-29 20:30:27,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156f2961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:27, skipping insertion in model container [2023-08-29 20:30:27,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:26" (2/3) ... [2023-08-29 20:30:27,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156f2961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:27, skipping insertion in model container [2023-08-29 20:30:27,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:27" (3/3) ... [2023-08-29 20:30:27,162 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-08-29 20:30:27,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:30:27,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:30:27,174 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:30:27,224 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:30:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2023-08-29 20:30:27,303 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-29 20:30:27,303 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:27,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:30:27,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2023-08-29 20:30:27,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2023-08-29 20:30:27,320 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:30:27,331 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2023-08-29 20:30:27,336 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2023-08-29 20:30:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2023-08-29 20:30:27,368 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2023-08-29 20:30:27,370 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:27,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:30:27,374 INFO L119 LiptonReduction]: Number of co-enabled transitions 3046 [2023-08-29 20:30:30,703 INFO L134 LiptonReduction]: Checked pairs total: 7257 [2023-08-29 20:30:30,704 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-29 20:30:30,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:30:30,716 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;@487cc85d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:30:30,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:30:30,718 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:30:30,718 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:30,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:30,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:30:30,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:30,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times [2023-08-29 20:30:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:30,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739249233] [2023-08-29 20:30:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739249233] [2023-08-29 20:30:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739249233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:30,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:30:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313058092] [2023-08-29 20:30:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:30,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:30:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:30,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:30:30,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:30:30,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 263 [2023-08-29 20:30:30,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:30,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:30,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 263 [2023-08-29 20:30:30,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:31,340 INFO L130 PetriNetUnfolder]: 4151/5785 cut-off events. [2023-08-29 20:30:31,340 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 20:30:31,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11577 conditions, 5785 events. 4151/5785 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 29920 event pairs, 4151 based on Foata normal form. 180/5070 useless extension candidates. Maximal degree in co-relation 11565. Up to 5689 conditions per place. [2023-08-29 20:30:31,367 INFO L137 encePairwiseOnDemand]: 254/263 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-29 20:30:31,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-29 20:30:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:30:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:30:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 285 transitions. [2023-08-29 20:30:31,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5418250950570342 [2023-08-29 20:30:31,382 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 285 transitions. [2023-08-29 20:30:31,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 285 transitions. [2023-08-29 20:30:31,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:31,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 285 transitions. [2023-08-29 20:30:31,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:31,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:31,392 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:31,393 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 285 transitions. [2023-08-29 20:30:31,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-29 20:30:31,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:31,398 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-29 20:30:31,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-29 20:30:31,402 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-29 20:30:31,403 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-29 20:30:31,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:31,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:31,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:31,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:30:31,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:31,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1057879311, now seen corresponding path program 1 times [2023-08-29 20:30:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:31,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915548930] [2023-08-29 20:30:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915548930] [2023-08-29 20:30:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915548930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:31,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:30:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777513479] [2023-08-29 20:30:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:31,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:31,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 263 [2023-08-29 20:30:31,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:31,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:31,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 263 [2023-08-29 20:30:31,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:32,076 INFO L130 PetriNetUnfolder]: 3299/4852 cut-off events. [2023-08-29 20:30:32,076 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:32,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9501 conditions, 4852 events. 3299/4852 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27116 event pairs, 743 based on Foata normal form. 0/4407 useless extension candidates. Maximal degree in co-relation 9498. Up to 3421 conditions per place. [2023-08-29 20:30:32,089 INFO L137 encePairwiseOnDemand]: 260/263 looper letters, 33 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-08-29 20:30:32,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 172 flow [2023-08-29 20:30:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-29 20:30:32,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221799746514575 [2023-08-29 20:30:32,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-29 20:30:32,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-29 20:30:32,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:32,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-29 20:30:32,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:32,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:32,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:32,096 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 412 transitions. [2023-08-29 20:30:32,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 172 flow [2023-08-29 20:30:32,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:30:32,098 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-29 20:30:32,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-29 20:30:32,099 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-29 20:30:32,099 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-29 20:30:32,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:32,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:32,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:32,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:30:32,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:32,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1185474833, now seen corresponding path program 1 times [2023-08-29 20:30:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901924303] [2023-08-29 20:30:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901924303] [2023-08-29 20:30:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901924303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410154117] [2023-08-29 20:30:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:32,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:32,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 263 [2023-08-29 20:30:32,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:32,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:32,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 263 [2023-08-29 20:30:32,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:33,087 INFO L130 PetriNetUnfolder]: 2075/2932 cut-off events. [2023-08-29 20:30:33,089 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-08-29 20:30:33,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 2932 events. 2075/2932 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13887 event pairs, 792 based on Foata normal form. 0/2905 useless extension candidates. Maximal degree in co-relation 6103. Up to 2763 conditions per place. [2023-08-29 20:30:33,102 INFO L137 encePairwiseOnDemand]: 258/263 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-29 20:30:33,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 160 flow [2023-08-29 20:30:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-08-29 20:30:33,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42585551330798477 [2023-08-29 20:30:33,105 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-08-29 20:30:33,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-08-29 20:30:33,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:33,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-08-29 20:30:33,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:33,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:33,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:33,110 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 6 states and 672 transitions. [2023-08-29 20:30:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 160 flow [2023-08-29 20:30:33,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:33,112 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 68 flow [2023-08-29 20:30:33,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-29 20:30:33,113 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-29 20:30:33,116 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 68 flow [2023-08-29 20:30:33,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:33,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:33,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:33,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:30:33,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:33,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1185474895, now seen corresponding path program 1 times [2023-08-29 20:30:33,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:33,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494746385] [2023-08-29 20:30:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:33,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494746385] [2023-08-29 20:30:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494746385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:33,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030568588] [2023-08-29 20:30:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:33,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:33,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 263 [2023-08-29 20:30:33,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:33,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:33,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 263 [2023-08-29 20:30:33,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:34,774 INFO L130 PetriNetUnfolder]: 7563/10510 cut-off events. [2023-08-29 20:30:34,775 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-08-29 20:30:34,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21379 conditions, 10510 events. 7563/10510 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 55099 event pairs, 1131 based on Foata normal form. 476/10984 useless extension candidates. Maximal degree in co-relation 21375. Up to 6599 conditions per place. [2023-08-29 20:30:34,813 INFO L137 encePairwiseOnDemand]: 252/263 looper letters, 50 selfloop transitions, 11 changer transitions 36/98 dead transitions. [2023-08-29 20:30:34,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 426 flow [2023-08-29 20:30:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-29 20:30:34,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4839760999456817 [2023-08-29 20:30:34,816 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-29 20:30:34,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-29 20:30:34,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:34,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-29 20:30:34,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:34,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:34,821 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:34,821 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 68 flow. Second operand 7 states and 891 transitions. [2023-08-29 20:30:34,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 426 flow [2023-08-29 20:30:34,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 98 transitions, 411 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:34,823 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 147 flow [2023-08-29 20:30:34,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-29 20:30:34,823 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-29 20:30:34,824 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 147 flow [2023-08-29 20:30:34,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:34,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:34,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:34,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:30:34,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:34,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:34,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1904968239, now seen corresponding path program 1 times [2023-08-29 20:30:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:34,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742758737] [2023-08-29 20:30:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742758737] [2023-08-29 20:30:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742758737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:35,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:35,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399489908] [2023-08-29 20:30:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:35,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 263 [2023-08-29 20:30:35,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:35,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:35,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 263 [2023-08-29 20:30:35,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:36,629 INFO L130 PetriNetUnfolder]: 9123/12686 cut-off events. [2023-08-29 20:30:36,629 INFO L131 PetriNetUnfolder]: For 9374/9374 co-relation queries the response was YES. [2023-08-29 20:30:36,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37753 conditions, 12686 events. 9123/12686 cut-off events. For 9374/9374 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 64148 event pairs, 1281 based on Foata normal form. 510/13196 useless extension candidates. Maximal degree in co-relation 37744. Up to 8033 conditions per place. [2023-08-29 20:30:36,676 INFO L137 encePairwiseOnDemand]: 251/263 looper letters, 54 selfloop transitions, 19 changer transitions 44/117 dead transitions. [2023-08-29 20:30:36,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 117 transitions, 701 flow [2023-08-29 20:30:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-29 20:30:36,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763715372080391 [2023-08-29 20:30:36,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-29 20:30:36,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-29 20:30:36,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:36,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-29 20:30:36,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,682 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,683 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 147 flow. Second operand 7 states and 877 transitions. [2023-08-29 20:30:36,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 117 transitions, 701 flow [2023-08-29 20:30:36,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 117 transitions, 693 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:36,817 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 335 flow [2023-08-29 20:30:36,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-08-29 20:30:36,818 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-29 20:30:36,818 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 335 flow [2023-08-29 20:30:36,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:36,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:30:36,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:36,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1891814392, now seen corresponding path program 1 times [2023-08-29 20:30:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864225063] [2023-08-29 20:30:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:37,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864225063] [2023-08-29 20:30:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864225063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:37,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:37,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377029188] [2023-08-29 20:30:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:37,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:37,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:37,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 263 [2023-08-29 20:30:37,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:37,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:37,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 263 [2023-08-29 20:30:37,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:38,515 INFO L130 PetriNetUnfolder]: 9350/12961 cut-off events. [2023-08-29 20:30:38,516 INFO L131 PetriNetUnfolder]: For 28689/28689 co-relation queries the response was YES. [2023-08-29 20:30:38,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49464 conditions, 12961 events. 9350/12961 cut-off events. For 28689/28689 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 65011 event pairs, 1225 based on Foata normal form. 430/13391 useless extension candidates. Maximal degree in co-relation 49451. Up to 8137 conditions per place. [2023-08-29 20:30:38,569 INFO L137 encePairwiseOnDemand]: 251/263 looper letters, 56 selfloop transitions, 25 changer transitions 30/111 dead transitions. [2023-08-29 20:30:38,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 899 flow [2023-08-29 20:30:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2023-08-29 20:30:38,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47718631178707227 [2023-08-29 20:30:38,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2023-08-29 20:30:38,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2023-08-29 20:30:38,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:38,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2023-08-29 20:30:38,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:38,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:38,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:38,575 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 335 flow. Second operand 6 states and 753 transitions. [2023-08-29 20:30:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 899 flow [2023-08-29 20:30:38,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 111 transitions, 895 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-29 20:30:38,622 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 527 flow [2023-08-29 20:30:38,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-29 20:30:38,625 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-29 20:30:38,625 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 527 flow [2023-08-29 20:30:38,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:38,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:38,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:38,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:30:38,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:38,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash 810998244, now seen corresponding path program 2 times [2023-08-29 20:30:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115771482] [2023-08-29 20:30:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:39,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115771482] [2023-08-29 20:30:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115771482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:39,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:39,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440871200] [2023-08-29 20:30:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:39,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:39,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:39,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 263 [2023-08-29 20:30:39,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:39,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:39,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 263 [2023-08-29 20:30:39,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:40,331 INFO L130 PetriNetUnfolder]: 10047/13898 cut-off events. [2023-08-29 20:30:40,332 INFO L131 PetriNetUnfolder]: For 62473/62473 co-relation queries the response was YES. [2023-08-29 20:30:40,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64544 conditions, 13898 events. 10047/13898 cut-off events. For 62473/62473 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 69848 event pairs, 1637 based on Foata normal form. 434/14332 useless extension candidates. Maximal degree in co-relation 64527. Up to 10271 conditions per place. [2023-08-29 20:30:40,405 INFO L137 encePairwiseOnDemand]: 251/263 looper letters, 108 selfloop transitions, 38 changer transitions 45/191 dead transitions. [2023-08-29 20:30:40,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 191 transitions, 2077 flow [2023-08-29 20:30:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:30:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:30:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1106 transitions. [2023-08-29 20:30:40,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672581326573722 [2023-08-29 20:30:40,409 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1106 transitions. [2023-08-29 20:30:40,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1106 transitions. [2023-08-29 20:30:40,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:40,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1106 transitions. [2023-08-29 20:30:40,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.88888888888889) internal successors, (1106), 9 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,415 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,415 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 527 flow. Second operand 9 states and 1106 transitions. [2023-08-29 20:30:40,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 191 transitions, 2077 flow [2023-08-29 20:30:40,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 191 transitions, 2062 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:40,503 INFO L231 Difference]: Finished difference. Result has 72 places, 94 transitions, 1123 flow [2023-08-29 20:30:40,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1123, PETRI_PLACES=72, PETRI_TRANSITIONS=94} [2023-08-29 20:30:40,503 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-29 20:30:40,503 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 94 transitions, 1123 flow [2023-08-29 20:30:40,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:40,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:40,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:30:40,504 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:40,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1076525518, now seen corresponding path program 3 times [2023-08-29 20:30:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454482706] [2023-08-29 20:30:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:41,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454482706] [2023-08-29 20:30:41,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454482706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:41,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:41,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007511738] [2023-08-29 20:30:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:41,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:41,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 263 [2023-08-29 20:30:41,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 94 transitions, 1123 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:41,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:41,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 263 [2023-08-29 20:30:41,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:42,423 INFO L130 PetriNetUnfolder]: 9610/13325 cut-off events. [2023-08-29 20:30:42,423 INFO L131 PetriNetUnfolder]: For 98592/98592 co-relation queries the response was YES. [2023-08-29 20:30:42,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73069 conditions, 13325 events. 9610/13325 cut-off events. For 98592/98592 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 67065 event pairs, 1327 based on Foata normal form. 410/13735 useless extension candidates. Maximal degree in co-relation 73045. Up to 7295 conditions per place. [2023-08-29 20:30:42,495 INFO L137 encePairwiseOnDemand]: 251/263 looper letters, 92 selfloop transitions, 63 changer transitions 45/200 dead transitions. [2023-08-29 20:30:42,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 200 transitions, 2577 flow [2023-08-29 20:30:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:30:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:30:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 991 transitions. [2023-08-29 20:30:42,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47100760456273766 [2023-08-29 20:30:42,498 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 991 transitions. [2023-08-29 20:30:42,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 991 transitions. [2023-08-29 20:30:42,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:42,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 991 transitions. [2023-08-29 20:30:42,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 263.0) internal successors, (2367), 9 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,503 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 263.0) internal successors, (2367), 9 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,503 INFO L175 Difference]: Start difference. First operand has 72 places, 94 transitions, 1123 flow. Second operand 8 states and 991 transitions. [2023-08-29 20:30:42,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 200 transitions, 2577 flow [2023-08-29 20:30:42,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 200 transitions, 2495 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:42,631 INFO L231 Difference]: Finished difference. Result has 79 places, 119 transitions, 1721 flow [2023-08-29 20:30:42,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1721, PETRI_PLACES=79, PETRI_TRANSITIONS=119} [2023-08-29 20:30:42,632 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-29 20:30:42,632 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 119 transitions, 1721 flow [2023-08-29 20:30:42,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:42,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:42,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:30:42,633 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:42,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 802081978, now seen corresponding path program 1 times [2023-08-29 20:30:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373530056] [2023-08-29 20:30:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373530056] [2023-08-29 20:30:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373530056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027137974] [2023-08-29 20:30:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:42,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:42,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:42,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 263 [2023-08-29 20:30:42,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 119 transitions, 1721 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:42,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 263 [2023-08-29 20:30:42,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:44,022 INFO L130 PetriNetUnfolder]: 7366/10603 cut-off events. [2023-08-29 20:30:44,022 INFO L131 PetriNetUnfolder]: For 114213/115222 co-relation queries the response was YES. [2023-08-29 20:30:44,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67029 conditions, 10603 events. 7366/10603 cut-off events. For 114213/115222 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 58140 event pairs, 1200 based on Foata normal form. 767/11235 useless extension candidates. Maximal degree in co-relation 67002. Up to 6771 conditions per place. [2023-08-29 20:30:44,118 INFO L137 encePairwiseOnDemand]: 258/263 looper letters, 99 selfloop transitions, 12 changer transitions 20/163 dead transitions. [2023-08-29 20:30:44,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 163 transitions, 2449 flow [2023-08-29 20:30:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2023-08-29 20:30:44,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49809885931558934 [2023-08-29 20:30:44,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 786 transitions. [2023-08-29 20:30:44,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 786 transitions. [2023-08-29 20:30:44,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:44,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 786 transitions. [2023-08-29 20:30:44,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:44,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:44,125 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:44,125 INFO L175 Difference]: Start difference. First operand has 79 places, 119 transitions, 1721 flow. Second operand 6 states and 786 transitions. [2023-08-29 20:30:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 163 transitions, 2449 flow [2023-08-29 20:30:44,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 163 transitions, 2362 flow, removed 39 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:44,278 INFO L231 Difference]: Finished difference. Result has 80 places, 119 transitions, 1700 flow [2023-08-29 20:30:44,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1700, PETRI_PLACES=80, PETRI_TRANSITIONS=119} [2023-08-29 20:30:44,279 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-29 20:30:44,279 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 119 transitions, 1700 flow [2023-08-29 20:30:44,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:44,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:44,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:44,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:30:44,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:44,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -907529761, now seen corresponding path program 1 times [2023-08-29 20:30:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:44,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952705591] [2023-08-29 20:30:44,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:44,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952705591] [2023-08-29 20:30:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952705591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:44,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:44,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260537882] [2023-08-29 20:30:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:44,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:44,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 263 [2023-08-29 20:30:44,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 119 transitions, 1700 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:44,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:44,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 263 [2023-08-29 20:30:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:45,621 INFO L130 PetriNetUnfolder]: 7630/10948 cut-off events. [2023-08-29 20:30:45,622 INFO L131 PetriNetUnfolder]: For 98868/99976 co-relation queries the response was YES. [2023-08-29 20:30:45,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66517 conditions, 10948 events. 7630/10948 cut-off events. For 98868/99976 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 60195 event pairs, 1467 based on Foata normal form. 724/11532 useless extension candidates. Maximal degree in co-relation 66489. Up to 6832 conditions per place. [2023-08-29 20:30:45,694 INFO L137 encePairwiseOnDemand]: 255/263 looper letters, 102 selfloop transitions, 30 changer transitions 19/183 dead transitions. [2023-08-29 20:30:45,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 183 transitions, 2744 flow [2023-08-29 20:30:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2023-08-29 20:30:45,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48940793047256925 [2023-08-29 20:30:45,697 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 901 transitions. [2023-08-29 20:30:45,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 901 transitions. [2023-08-29 20:30:45,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:45,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 901 transitions. [2023-08-29 20:30:45,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,701 INFO L175 Difference]: Start difference. First operand has 80 places, 119 transitions, 1700 flow. Second operand 7 states and 901 transitions. [2023-08-29 20:30:45,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 183 transitions, 2744 flow [2023-08-29 20:30:45,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 183 transitions, 2718 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 20:30:45,809 INFO L231 Difference]: Finished difference. Result has 83 places, 132 transitions, 2020 flow [2023-08-29 20:30:45,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2020, PETRI_PLACES=83, PETRI_TRANSITIONS=132} [2023-08-29 20:30:45,810 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-29 20:30:45,810 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 132 transitions, 2020 flow [2023-08-29 20:30:45,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:45,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:45,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:30:45,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:45,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash -905309851, now seen corresponding path program 2 times [2023-08-29 20:30:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109368633] [2023-08-29 20:30:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:46,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:46,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109368633] [2023-08-29 20:30:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109368633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:46,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787545488] [2023-08-29 20:30:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:46,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:46,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 263 [2023-08-29 20:30:46,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 132 transitions, 2020 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:46,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:46,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 263 [2023-08-29 20:30:46,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:47,827 INFO L130 PetriNetUnfolder]: 10184/14095 cut-off events. [2023-08-29 20:30:47,830 INFO L131 PetriNetUnfolder]: For 146931/146931 co-relation queries the response was YES. [2023-08-29 20:30:47,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90512 conditions, 14095 events. 10184/14095 cut-off events. For 146931/146931 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 70966 event pairs, 1465 based on Foata normal form. 294/14389 useless extension candidates. Maximal degree in co-relation 90483. Up to 9848 conditions per place. [2023-08-29 20:30:47,958 INFO L137 encePairwiseOnDemand]: 253/263 looper letters, 126 selfloop transitions, 69 changer transitions 28/223 dead transitions. [2023-08-29 20:30:47,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 223 transitions, 3720 flow [2023-08-29 20:30:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-08-29 20:30:47,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687669744703965 [2023-08-29 20:30:47,961 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-08-29 20:30:47,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-08-29 20:30:47,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:47,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-08-29 20:30:47,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:47,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:47,965 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:47,965 INFO L175 Difference]: Start difference. First operand has 83 places, 132 transitions, 2020 flow. Second operand 7 states and 863 transitions. [2023-08-29 20:30:47,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 223 transitions, 3720 flow [2023-08-29 20:30:48,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 223 transitions, 3718 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:30:48,195 INFO L231 Difference]: Finished difference. Result has 89 places, 154 transitions, 2704 flow [2023-08-29 20:30:48,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2704, PETRI_PLACES=89, PETRI_TRANSITIONS=154} [2023-08-29 20:30:48,196 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2023-08-29 20:30:48,196 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 154 transitions, 2704 flow [2023-08-29 20:30:48,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:48,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:30:48,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:48,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash -876249211, now seen corresponding path program 3 times [2023-08-29 20:30:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261658225] [2023-08-29 20:30:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261658225] [2023-08-29 20:30:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261658225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:48,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381482048] [2023-08-29 20:30:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:48,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:48,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 263 [2023-08-29 20:30:48,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 154 transitions, 2704 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:48,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 263 [2023-08-29 20:30:48,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:49,740 INFO L130 PetriNetUnfolder]: 8522/12248 cut-off events. [2023-08-29 20:30:49,740 INFO L131 PetriNetUnfolder]: For 180622/181718 co-relation queries the response was YES. [2023-08-29 20:30:49,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87493 conditions, 12248 events. 8522/12248 cut-off events. For 180622/181718 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 69164 event pairs, 1322 based on Foata normal form. 735/12861 useless extension candidates. Maximal degree in co-relation 87461. Up to 6375 conditions per place. [2023-08-29 20:30:49,827 INFO L137 encePairwiseOnDemand]: 256/263 looper letters, 110 selfloop transitions, 49 changer transitions 20/219 dead transitions. [2023-08-29 20:30:49,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 219 transitions, 3951 flow [2023-08-29 20:30:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:30:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:30:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions. [2023-08-29 20:30:49,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48954372623574144 [2023-08-29 20:30:49,831 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions. [2023-08-29 20:30:49,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions. [2023-08-29 20:30:49,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:49,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions. [2023-08-29 20:30:49,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:49,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 263.0) internal successors, (2367), 9 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:49,836 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 263.0) internal successors, (2367), 9 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:49,836 INFO L175 Difference]: Start difference. First operand has 89 places, 154 transitions, 2704 flow. Second operand 8 states and 1030 transitions. [2023-08-29 20:30:49,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 219 transitions, 3951 flow [2023-08-29 20:30:50,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 219 transitions, 3717 flow, removed 72 selfloop flow, removed 5 redundant places. [2023-08-29 20:30:50,217 INFO L231 Difference]: Finished difference. Result has 92 places, 162 transitions, 2848 flow [2023-08-29 20:30:50,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2517, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2848, PETRI_PLACES=92, PETRI_TRANSITIONS=162} [2023-08-29 20:30:50,219 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-08-29 20:30:50,220 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 162 transitions, 2848 flow [2023-08-29 20:30:50,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:50,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:50,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:30:50,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:50,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash 803875443, now seen corresponding path program 1 times [2023-08-29 20:30:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115155111] [2023-08-29 20:30:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115155111] [2023-08-29 20:30:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115155111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:50,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811852872] [2023-08-29 20:30:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:30:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:30:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:30:50,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-08-29 20:30:50,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 162 transitions, 2848 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:50,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-08-29 20:30:50,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:51,566 INFO L130 PetriNetUnfolder]: 6199/9142 cut-off events. [2023-08-29 20:30:51,566 INFO L131 PetriNetUnfolder]: For 189693/193903 co-relation queries the response was YES. [2023-08-29 20:30:51,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65642 conditions, 9142 events. 6199/9142 cut-off events. For 189693/193903 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 54630 event pairs, 851 based on Foata normal form. 1822/10712 useless extension candidates. Maximal degree in co-relation 65609. Up to 4095 conditions per place. [2023-08-29 20:30:51,613 INFO L137 encePairwiseOnDemand]: 256/263 looper letters, 223 selfloop transitions, 6 changer transitions 0/274 dead transitions. [2023-08-29 20:30:51,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 274 transitions, 5435 flow [2023-08-29 20:30:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:30:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:30:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-29 20:30:51,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714828897338403 [2023-08-29 20:30:51,615 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-29 20:30:51,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-29 20:30:51,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:51,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-29 20:30:51,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,618 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 263.0) internal successors, (1315), 5 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,618 INFO L175 Difference]: Start difference. First operand has 92 places, 162 transitions, 2848 flow. Second operand 4 states and 523 transitions. [2023-08-29 20:30:51,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 274 transitions, 5435 flow [2023-08-29 20:30:51,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 274 transitions, 5252 flow, removed 91 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:51,721 INFO L231 Difference]: Finished difference. Result has 91 places, 160 transitions, 2761 flow [2023-08-29 20:30:51,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2643, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2761, PETRI_PLACES=91, PETRI_TRANSITIONS=160} [2023-08-29 20:30:51,722 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2023-08-29 20:30:51,722 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 160 transitions, 2761 flow [2023-08-29 20:30:51,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:51,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:30:51,722 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:51,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2007497930, now seen corresponding path program 1 times [2023-08-29 20:30:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:51,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873950567] [2023-08-29 20:30:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:51,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:51,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873950567] [2023-08-29 20:30:51,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873950567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:51,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:51,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410696768] [2023-08-29 20:30:51,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:51,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:51,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:51,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-08-29 20:30:51,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 160 transitions, 2761 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:51,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-08-29 20:30:51,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:52,654 INFO L130 PetriNetUnfolder]: 4664/7133 cut-off events. [2023-08-29 20:30:52,654 INFO L131 PetriNetUnfolder]: For 148007/151842 co-relation queries the response was YES. [2023-08-29 20:30:52,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51360 conditions, 7133 events. 4664/7133 cut-off events. For 148007/151842 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 44294 event pairs, 529 based on Foata normal form. 1627/8510 useless extension candidates. Maximal degree in co-relation 51328. Up to 3001 conditions per place. [2023-08-29 20:30:52,694 INFO L137 encePairwiseOnDemand]: 256/263 looper letters, 250 selfloop transitions, 10 changer transitions 0/302 dead transitions. [2023-08-29 20:30:52,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 302 transitions, 5918 flow [2023-08-29 20:30:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-08-29 20:30:52,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988593155893536 [2023-08-29 20:30:52,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-08-29 20:30:52,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-08-29 20:30:52,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:52,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-08-29 20:30:52,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:52,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:52,700 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:52,700 INFO L175 Difference]: Start difference. First operand has 91 places, 160 transitions, 2761 flow. Second operand 5 states and 656 transitions. [2023-08-29 20:30:52,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 302 transitions, 5918 flow [2023-08-29 20:30:52,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 302 transitions, 5915 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:30:52,814 INFO L231 Difference]: Finished difference. Result has 96 places, 154 transitions, 2681 flow [2023-08-29 20:30:52,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2681, PETRI_PLACES=96, PETRI_TRANSITIONS=154} [2023-08-29 20:30:52,815 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2023-08-29 20:30:52,815 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 154 transitions, 2681 flow [2023-08-29 20:30:52,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:52,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:52,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:52,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:30:52,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:52,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1959468107, now seen corresponding path program 1 times [2023-08-29 20:30:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005220275] [2023-08-29 20:30:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005220275] [2023-08-29 20:30:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005220275] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132223603] [2023-08-29 20:30:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:53,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:53,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 263 [2023-08-29 20:30:53,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 154 transitions, 2681 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:53,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:53,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 263 [2023-08-29 20:30:53,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:54,353 INFO L130 PetriNetUnfolder]: 7620/11379 cut-off events. [2023-08-29 20:30:54,353 INFO L131 PetriNetUnfolder]: For 178993/179571 co-relation queries the response was YES. [2023-08-29 20:30:54,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86080 conditions, 11379 events. 7620/11379 cut-off events. For 178993/179571 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 67513 event pairs, 1135 based on Foata normal form. 590/11873 useless extension candidates. Maximal degree in co-relation 86046. Up to 5577 conditions per place. [2023-08-29 20:30:54,405 INFO L137 encePairwiseOnDemand]: 256/263 looper letters, 144 selfloop transitions, 24 changer transitions 80/254 dead transitions. [2023-08-29 20:30:54,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 254 transitions, 4522 flow [2023-08-29 20:30:54,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2023-08-29 20:30:54,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790874524714829 [2023-08-29 20:30:54,407 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 756 transitions. [2023-08-29 20:30:54,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 756 transitions. [2023-08-29 20:30:54,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:54,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 756 transitions. [2023-08-29 20:30:54,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:54,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:54,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:54,411 INFO L175 Difference]: Start difference. First operand has 96 places, 154 transitions, 2681 flow. Second operand 6 states and 756 transitions. [2023-08-29 20:30:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 254 transitions, 4522 flow [2023-08-29 20:30:54,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 254 transitions, 4494 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:54,818 INFO L231 Difference]: Finished difference. Result has 103 places, 130 transitions, 2285 flow [2023-08-29 20:30:54,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2666, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2285, PETRI_PLACES=103, PETRI_TRANSITIONS=130} [2023-08-29 20:30:54,819 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2023-08-29 20:30:54,820 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 130 transitions, 2285 flow [2023-08-29 20:30:54,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:54,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:54,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:54,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:30:54,820 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:54,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash 164813833, now seen corresponding path program 1 times [2023-08-29 20:30:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864664158] [2023-08-29 20:30:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:55,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:55,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864664158] [2023-08-29 20:30:55,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864664158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:55,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:55,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146256439] [2023-08-29 20:30:55,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:55,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:55,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:55,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-08-29 20:30:55,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 130 transitions, 2285 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:55,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-08-29 20:30:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:55,443 INFO L130 PetriNetUnfolder]: 2032/3302 cut-off events. [2023-08-29 20:30:55,443 INFO L131 PetriNetUnfolder]: For 61384/62367 co-relation queries the response was YES. [2023-08-29 20:30:55,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23924 conditions, 3302 events. 2032/3302 cut-off events. For 61384/62367 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19366 event pairs, 203 based on Foata normal form. 603/3793 useless extension candidates. Maximal degree in co-relation 23886. Up to 1258 conditions per place. [2023-08-29 20:30:55,462 INFO L137 encePairwiseOnDemand]: 256/263 looper letters, 190 selfloop transitions, 14 changer transitions 9/239 dead transitions. [2023-08-29 20:30:55,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 239 transitions, 4648 flow [2023-08-29 20:30:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-29 20:30:55,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49746514575411915 [2023-08-29 20:30:55,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-29 20:30:55,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-29 20:30:55,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:55,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-29 20:30:55,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,468 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,468 INFO L175 Difference]: Start difference. First operand has 103 places, 130 transitions, 2285 flow. Second operand 6 states and 785 transitions. [2023-08-29 20:30:55,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 239 transitions, 4648 flow [2023-08-29 20:30:55,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 239 transitions, 4512 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-29 20:30:55,546 INFO L231 Difference]: Finished difference. Result has 97 places, 116 transitions, 1914 flow [2023-08-29 20:30:55,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1849, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1914, PETRI_PLACES=97, PETRI_TRANSITIONS=116} [2023-08-29 20:30:55,547 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2023-08-29 20:30:55,547 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 116 transitions, 1914 flow [2023-08-29 20:30:55,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:55,547 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-29 20:30:55,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:30:55,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:55,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1090095382, now seen corresponding path program 1 times [2023-08-29 20:30:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728113475] [2023-08-29 20:30:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:55,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728113475] [2023-08-29 20:30:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728113475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:55,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304370579] [2023-08-29 20:30:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:55,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:55,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 263 [2023-08-29 20:30:55,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 116 transitions, 1914 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:55,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 263 [2023-08-29 20:30:55,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:56,185 INFO L130 PetriNetUnfolder]: 3047/4985 cut-off events. [2023-08-29 20:30:56,186 INFO L131 PetriNetUnfolder]: For 83409/84019 co-relation queries the response was YES. [2023-08-29 20:30:56,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38187 conditions, 4985 events. 3047/4985 cut-off events. For 83409/84019 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 31133 event pairs, 341 based on Foata normal form. 204/5096 useless extension candidates. Maximal degree in co-relation 38153. Up to 2531 conditions per place. [2023-08-29 20:30:56,210 INFO L137 encePairwiseOnDemand]: 259/263 looper letters, 146 selfloop transitions, 2 changer transitions 63/227 dead transitions. [2023-08-29 20:30:56,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 227 transitions, 3976 flow [2023-08-29 20:30:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-29 20:30:56,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034220532319391 [2023-08-29 20:30:56,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-29 20:30:56,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-29 20:30:56,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:56,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-29 20:30:56,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,215 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,215 INFO L175 Difference]: Start difference. First operand has 97 places, 116 transitions, 1914 flow. Second operand 5 states and 662 transitions. [2023-08-29 20:30:56,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 227 transitions, 3976 flow [2023-08-29 20:30:56,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 227 transitions, 3816 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:56,372 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 1777 flow [2023-08-29 20:30:56,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1777, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2023-08-29 20:30:56,373 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2023-08-29 20:30:56,373 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 1777 flow [2023-08-29 20:30:56,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:56,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:56,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:30:56,374 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:56,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -264029442, now seen corresponding path program 2 times [2023-08-29 20:30:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543162346] [2023-08-29 20:30:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:56,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:56,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543162346] [2023-08-29 20:30:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543162346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:56,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:56,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:30:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212173637] [2023-08-29 20:30:56,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:56,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:56,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-08-29 20:30:56,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 1777 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:56,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-08-29 20:30:56,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:57,042 INFO L130 PetriNetUnfolder]: 2550/4165 cut-off events. [2023-08-29 20:30:57,043 INFO L131 PetriNetUnfolder]: For 65557/66967 co-relation queries the response was YES. [2023-08-29 20:30:57,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29332 conditions, 4165 events. 2550/4165 cut-off events. For 65557/66967 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26404 event pairs, 189 based on Foata normal form. 527/4504 useless extension candidates. Maximal degree in co-relation 29295. Up to 1472 conditions per place. [2023-08-29 20:30:57,060 INFO L137 encePairwiseOnDemand]: 256/263 looper letters, 89 selfloop transitions, 18 changer transitions 98/217 dead transitions. [2023-08-29 20:30:57,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 217 transitions, 4044 flow [2023-08-29 20:30:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-08-29 20:30:57,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485605649103748 [2023-08-29 20:30:57,062 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-08-29 20:30:57,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-08-29 20:30:57,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:57,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-08-29 20:30:57,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,065 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,066 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 1777 flow. Second operand 7 states and 894 transitions. [2023-08-29 20:30:57,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 217 transitions, 4044 flow [2023-08-29 20:30:57,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 217 transitions, 3890 flow, removed 65 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:57,170 INFO L231 Difference]: Finished difference. Result has 103 places, 70 transitions, 1001 flow [2023-08-29 20:30:57,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1001, PETRI_PLACES=103, PETRI_TRANSITIONS=70} [2023-08-29 20:30:57,171 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2023-08-29 20:30:57,171 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 70 transitions, 1001 flow [2023-08-29 20:30:57,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:57,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:57,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:30:57,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:57,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1966015312, now seen corresponding path program 1 times [2023-08-29 20:30:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:57,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589032415] [2023-08-29 20:30:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589032415] [2023-08-29 20:30:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589032415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151954455] [2023-08-29 20:30:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:57,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:57,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 263 [2023-08-29 20:30:57,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 70 transitions, 1001 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:57,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 263 [2023-08-29 20:30:57,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:57,863 INFO L130 PetriNetUnfolder]: 548/938 cut-off events. [2023-08-29 20:30:57,864 INFO L131 PetriNetUnfolder]: For 10730/10774 co-relation queries the response was YES. [2023-08-29 20:30:57,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6869 conditions, 938 events. 548/938 cut-off events. For 10730/10774 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4164 event pairs, 59 based on Foata normal form. 34/968 useless extension candidates. Maximal degree in co-relation 6833. Up to 461 conditions per place. [2023-08-29 20:30:57,867 INFO L137 encePairwiseOnDemand]: 253/263 looper letters, 51 selfloop transitions, 8 changer transitions 80/141 dead transitions. [2023-08-29 20:30:57,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 141 transitions, 2036 flow [2023-08-29 20:30:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-29 20:30:57,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579033134166214 [2023-08-29 20:30:57,869 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-29 20:30:57,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-29 20:30:57,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:57,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-29 20:30:57,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,872 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 263.0) internal successors, (2104), 8 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,872 INFO L175 Difference]: Start difference. First operand has 103 places, 70 transitions, 1001 flow. Second operand 7 states and 843 transitions. [2023-08-29 20:30:57,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 141 transitions, 2036 flow [2023-08-29 20:30:57,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 141 transitions, 1516 flow, removed 89 selfloop flow, removed 27 redundant places. [2023-08-29 20:30:57,887 INFO L231 Difference]: Finished difference. Result has 83 places, 47 transitions, 370 flow [2023-08-29 20:30:57,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=83, PETRI_TRANSITIONS=47} [2023-08-29 20:30:57,887 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-29 20:30:57,887 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 47 transitions, 370 flow [2023-08-29 20:30:57,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:57,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:57,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:57,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:30:57,888 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:57,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1646786672, now seen corresponding path program 2 times [2023-08-29 20:30:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475154479] [2023-08-29 20:30:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:30:57,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:30:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:30:57,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:30:57,972 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:30:57,973 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:30:57,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:30:57,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:30:57,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:30:57,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:30:57,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:30:57,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:30:57,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:30:57,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:30:57,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:30:57,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:30:57,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:30:57,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:30:57,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:30:57,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:30:57,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:30:57,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:30:57,977 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:57,980 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:30:57,981 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:30:58,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:30:58 BasicIcfg [2023-08-29 20:30:58,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:30:58,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:30:58,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:30:58,035 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:30:58,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:27" (3/4) ... [2023-08-29 20:30:58,037 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:30:58,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:30:58,038 INFO L158 Benchmark]: Toolchain (without parser) took 32011.82ms. Allocated memory was 104.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 80.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-29 20:30:58,038 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 69.2MB. Free memory was 47.2MB in the beginning and 47.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:58,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.42ms. Allocated memory is still 104.9MB. Free memory was 80.4MB in the beginning and 57.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-29 20:30:58,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.35ms. Allocated memory is still 104.9MB. Free memory was 57.3MB in the beginning and 54.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:58,038 INFO L158 Benchmark]: Boogie Preprocessor took 22.54ms. Allocated memory is still 104.9MB. Free memory was 54.5MB in the beginning and 52.8MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:30:58,038 INFO L158 Benchmark]: RCFGBuilder took 593.35ms. Allocated memory is still 104.9MB. Free memory was 52.5MB in the beginning and 49.2MB in the end (delta: 3.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-08-29 20:30:58,039 INFO L158 Benchmark]: TraceAbstraction took 30877.23ms. Allocated memory was 104.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 81.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-29 20:30:58,039 INFO L158 Benchmark]: Witness Printer took 2.41ms. Allocated memory is still 2.6GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:58,039 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.28ms. Allocated memory is still 69.2MB. Free memory was 47.2MB in the beginning and 47.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.42ms. Allocated memory is still 104.9MB. Free memory was 80.4MB in the beginning and 57.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.35ms. Allocated memory is still 104.9MB. Free memory was 57.3MB in the beginning and 54.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.54ms. Allocated memory is still 104.9MB. Free memory was 54.5MB in the beginning and 52.8MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 593.35ms. Allocated memory is still 104.9MB. Free memory was 52.5MB in the beginning and 49.2MB in the end (delta: 3.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30877.23ms. Allocated memory was 104.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 81.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.41ms. Allocated memory is still 2.6GB. Free memory is still 1.5GB. 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.4s, 145 PlacesBefore, 51 PlacesAfterwards, 134 TransitionsBefore, 39 TransitionsAfterwards, 3046 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 7257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3485, independent: 3310, independent conditional: 0, independent unconditional: 3310, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1593, independent: 1562, independent conditional: 0, independent unconditional: 1562, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3485, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1593, unknown conditional: 0, unknown unconditional: 1593] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-2, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=1, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 843]: 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: 841]: 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: 839]: 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 9 procedures, 172 locations, 16 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: 30.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1272 mSDsluCounter, 821 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 630 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3105 IncrementalHoareTripleChecker+Invalid, 3350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 191 mSDtfsCounter, 3105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2848occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 3135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:30:58,062 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/mix055.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:30:59,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:30:59,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:31:00,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:31:00,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:31:00,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:31:00,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:31:00,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:31:00,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:31:00,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:31:00,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:31:00,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:31:00,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:31:00,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:31:00,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:31:00,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:31:00,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:31:00,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:31:00,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:31:00,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:31:00,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:31:00,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:31:00,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:31:00,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:31:00,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:31:00,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:31:00,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:31:00,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:31:00,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:31:00,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:31:00,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:31:00,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:31:00,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:31:00,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:31:00,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:31:00,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:31:00,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:31:00,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:31:00,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:31:00,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:31:00,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:31:00,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:31:00,078 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:31:00,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:31:00,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:31:00,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:31:00,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:31:00,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:31:00,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:31:00,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:31:00,080 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:31:00,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:31:00,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:31:00,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:31:00,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:31:00,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:31:00,083 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:31:00,083 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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:31:00,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:31:00,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:31:00,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:31:00,351 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:31:00,351 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:31:00,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-29 20:31:01,290 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:31:01,519 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:31:01,520 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-08-29 20:31:01,535 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5646326b3/30e01bdbb9874efd93b013779de616fe/FLAG10891ab90 [2023-08-29 20:31:01,547 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5646326b3/30e01bdbb9874efd93b013779de616fe [2023-08-29 20:31:01,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:31:01,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:31:01,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:31:01,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:31:01,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:31:01,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:31:01" (1/1) ... [2023-08-29 20:31:01,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6cbf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:01, skipping insertion in model container [2023-08-29 20:31:01,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:31:01" (1/1) ... [2023-08-29 20:31:01,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:31:01,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:31:01,771 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/mix055.opt.i[944,957] [2023-08-29 20:31:01,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:31:01,967 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:31:01,976 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/mix055.opt.i[944,957] [2023-08-29 20:31:02,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:31:02,055 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:31:02,056 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:31:02,060 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:31:02,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02 WrapperNode [2023-08-29 20:31:02,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:31:02,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:31:02,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:31:02,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:31:02,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,100 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-29 20:31:02,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:31:02,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:31:02,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:31:02,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:31:02,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,130 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:31:02,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:31:02,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:31:02,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:31:02,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (1/1) ... [2023-08-29 20:31:02,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:31:02,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:31:02,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:31:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:31:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:31:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:31:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:31:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:31:02,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:31:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:31:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:31:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:31:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:31:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:31:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:31:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:31:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:31:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:31:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:31:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:31:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:31:02,233 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:31:02,359 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:31:02,360 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:31:02,660 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:31:02,757 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:31:02,760 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:31:02,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:02 BoogieIcfgContainer [2023-08-29 20:31:02,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:31:02,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:31:02,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:31:02,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:31:02,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:31:01" (1/3) ... [2023-08-29 20:31:02,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b29adbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:31:02, skipping insertion in model container [2023-08-29 20:31:02,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:02" (2/3) ... [2023-08-29 20:31:02,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b29adbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:31:02, skipping insertion in model container [2023-08-29 20:31:02,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:02" (3/3) ... [2023-08-29 20:31:02,770 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-08-29 20:31:02,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:31:02,784 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:31:02,784 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:31:02,845 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:31:02,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2023-08-29 20:31:02,932 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-29 20:31:02,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:02,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:31:02,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2023-08-29 20:31:02,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2023-08-29 20:31:02,946 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:31:02,956 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-29 20:31:02,958 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-29 20:31:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2023-08-29 20:31:02,980 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-29 20:31:02,981 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:02,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-29 20:31:02,985 INFO L119 LiptonReduction]: Number of co-enabled transitions 3046 [2023-08-29 20:31:08,302 INFO L134 LiptonReduction]: Checked pairs total: 7882 [2023-08-29 20:31:08,302 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-29 20:31:08,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:31:08,317 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;@101ad65d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:31:08,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:31:08,319 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:31:08,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:08,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:08,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:31:08,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:08,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 570, now seen corresponding path program 1 times [2023-08-29 20:31:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:08,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746338403] [2023-08-29 20:31:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:08,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:31:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:08,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:31:08,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:08,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:08,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746338403] [2023-08-29 20:31:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746338403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:31:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245013956] [2023-08-29 20:31:08,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:08,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:31:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:31:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:31:08,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 265 [2023-08-29 20:31:08,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:08,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:08,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 265 [2023-08-29 20:31:08,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:09,042 INFO L130 PetriNetUnfolder]: 4151/5785 cut-off events. [2023-08-29 20:31:09,042 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 20:31:09,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11577 conditions, 5785 events. 4151/5785 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 29968 event pairs, 4151 based on Foata normal form. 180/5070 useless extension candidates. Maximal degree in co-relation 11565. Up to 5689 conditions per place. [2023-08-29 20:31:09,072 INFO L137 encePairwiseOnDemand]: 256/265 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-29 20:31:09,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-29 20:31:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:31:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:31:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-29 20:31:09,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5415094339622641 [2023-08-29 20:31:09,087 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-29 20:31:09,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-29 20:31:09,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:09,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-29 20:31:09,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,096 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,097 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 287 transitions. [2023-08-29 20:31:09,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-29 20:31:09,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:09,104 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-29 20:31:09,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-29 20:31:09,108 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-29 20:31:09,109 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-29 20:31:09,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:09,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:09,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:31:09,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:09,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:09,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash -137792046, now seen corresponding path program 1 times [2023-08-29 20:31:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617376974] [2023-08-29 20:31:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:09,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:09,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:09,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:31:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:09,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:09,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:09,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:09,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:09,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617376974] [2023-08-29 20:31:09,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617376974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:09,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:09,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:31:09,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867596977] [2023-08-29 20:31:09,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:09,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:09,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:09,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 265 [2023-08-29 20:31:09,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:09,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 265 [2023-08-29 20:31:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:09,843 INFO L130 PetriNetUnfolder]: 3299/4852 cut-off events. [2023-08-29 20:31:09,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:09,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9501 conditions, 4852 events. 3299/4852 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27253 event pairs, 743 based on Foata normal form. 0/4407 useless extension candidates. Maximal degree in co-relation 9498. Up to 3421 conditions per place. [2023-08-29 20:31:09,861 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 33 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-08-29 20:31:09,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 172 flow [2023-08-29 20:31:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:31:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:31:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:31:09,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220125786163522 [2023-08-29 20:31:09,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:31:09,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:31:09,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:09,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:31:09,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,867 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:31:09,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 172 flow [2023-08-29 20:31:09,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:31:09,868 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-29 20:31:09,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-29 20:31:09,868 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-29 20:31:09,869 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-29 20:31:09,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:09,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:09,897 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-29 20:31:10,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:10,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:10,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1027944363, now seen corresponding path program 1 times [2023-08-29 20:31:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944194458] [2023-08-29 20:31:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:10,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:10,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:31:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:10,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:10,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:10,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:10,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944194458] [2023-08-29 20:31:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944194458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:10,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:10,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:10,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833590623] [2023-08-29 20:31:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:10,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:10,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:10,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:10,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-29 20:31:10,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:10,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-29 20:31:10,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:10,561 INFO L130 PetriNetUnfolder]: 2063/3021 cut-off events. [2023-08-29 20:31:10,561 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-08-29 20:31:10,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 3021 events. 2063/3021 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15502 event pairs, 209 based on Foata normal form. 144/3050 useless extension candidates. Maximal degree in co-relation 6300. Up to 1861 conditions per place. [2023-08-29 20:31:10,574 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 43 selfloop transitions, 6 changer transitions 1/54 dead transitions. [2023-08-29 20:31:10,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 230 flow [2023-08-29 20:31:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:31:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:31:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-29 20:31:10,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981132075471698 [2023-08-29 20:31:10,576 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-29 20:31:10,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-29 20:31:10,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:10,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-29 20:31:10,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,581 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,581 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 4 states and 528 transitions. [2023-08-29 20:31:10,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 230 flow [2023-08-29 20:31:10,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:10,584 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 104 flow [2023-08-29 20:31:10,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-29 20:31:10,585 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-29 20:31:10,585 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 104 flow [2023-08-29 20:31:10,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:10,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:10,599 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-29 20:31:10,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:10,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:10,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash -808742932, now seen corresponding path program 1 times [2023-08-29 20:31:10,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478276447] [2023-08-29 20:31:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:10,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:10,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:31:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:10,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:10,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:10,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:10,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478276447] [2023-08-29 20:31:10,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478276447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:10,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:10,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368602455] [2023-08-29 20:31:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:10,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-29 20:31:10,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:10,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-29 20:31:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:11,203 INFO L130 PetriNetUnfolder]: 1079/1689 cut-off events. [2023-08-29 20:31:11,203 INFO L131 PetriNetUnfolder]: For 580/580 co-relation queries the response was YES. [2023-08-29 20:31:11,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4402 conditions, 1689 events. 1079/1689 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8255 event pairs, 101 based on Foata normal form. 108/1742 useless extension candidates. Maximal degree in co-relation 4396. Up to 661 conditions per place. [2023-08-29 20:31:11,210 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 53 selfloop transitions, 10 changer transitions 1/68 dead transitions. [2023-08-29 20:31:11,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 335 flow [2023-08-29 20:31:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-29 20:31:11,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49886792452830186 [2023-08-29 20:31:11,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-29 20:31:11,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-29 20:31:11,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:11,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-29 20:31:11,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,216 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 104 flow. Second operand 5 states and 661 transitions. [2023-08-29 20:31:11,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 335 flow [2023-08-29 20:31:11,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 324 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:11,219 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 156 flow [2023-08-29 20:31:11,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-29 20:31:11,220 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-29 20:31:11,221 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 156 flow [2023-08-29 20:31:11,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:11,221 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-29 20:31:11,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-29 20:31:11,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:11,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:11,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 716329775, now seen corresponding path program 1 times [2023-08-29 20:31:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538480498] [2023-08-29 20:31:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:11,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:11,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:11,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:31:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:11,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:31:11,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:11,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:11,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538480498] [2023-08-29 20:31:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538480498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:11,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:11,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:31:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809413513] [2023-08-29 20:31:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:11,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-29 20:31:11,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:11,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-29 20:31:11,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:11,758 INFO L130 PetriNetUnfolder]: 566/931 cut-off events. [2023-08-29 20:31:11,758 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2023-08-29 20:31:11,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2889 conditions, 931 events. 566/931 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4060 event pairs, 99 based on Foata normal form. 48/961 useless extension candidates. Maximal degree in co-relation 2882. Up to 314 conditions per place. [2023-08-29 20:31:11,762 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 61 selfloop transitions, 14 changer transitions 1/80 dead transitions. [2023-08-29 20:31:11,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 446 flow [2023-08-29 20:31:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 792 transitions. [2023-08-29 20:31:11,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981132075471698 [2023-08-29 20:31:11,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 792 transitions. [2023-08-29 20:31:11,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 792 transitions. [2023-08-29 20:31:11,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:11,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 792 transitions. [2023-08-29 20:31:11,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,768 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 156 flow. Second operand 6 states and 792 transitions. [2023-08-29 20:31:11,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 446 flow [2023-08-29 20:31:11,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 416 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:11,773 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 206 flow [2023-08-29 20:31:11,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-29 20:31:11,774 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-29 20:31:11,774 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 206 flow [2023-08-29 20:31:11,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:11,775 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-29 20:31:11,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:11,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:11,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:11,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 865363478, now seen corresponding path program 1 times [2023-08-29 20:31:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018742742] [2023-08-29 20:31:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:11,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:11,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:11,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:12,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:31:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:12,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:31:12,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:12,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:12,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018742742] [2023-08-29 20:31:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018742742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:12,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640528526] [2023-08-29 20:31:12,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:12,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:31:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:31:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:31:12,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 265 [2023-08-29 20:31:12,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:12,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:12,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 265 [2023-08-29 20:31:12,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:12,377 INFO L130 PetriNetUnfolder]: 452/730 cut-off events. [2023-08-29 20:31:12,377 INFO L131 PetriNetUnfolder]: For 849/849 co-relation queries the response was YES. [2023-08-29 20:31:12,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2365 conditions, 730 events. 452/730 cut-off events. For 849/849 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3016 event pairs, 99 based on Foata normal form. 11/733 useless extension candidates. Maximal degree in co-relation 2357. Up to 290 conditions per place. [2023-08-29 20:31:12,380 INFO L137 encePairwiseOnDemand]: 258/265 looper letters, 47 selfloop transitions, 18 changer transitions 1/70 dead transitions. [2023-08-29 20:31:12,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 416 flow [2023-08-29 20:31:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 901 transitions. [2023-08-29 20:31:12,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-29 20:31:12,382 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 901 transitions. [2023-08-29 20:31:12,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 901 transitions. [2023-08-29 20:31:12,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:12,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 901 transitions. [2023-08-29 20:31:12,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.71428571428572) internal successors, (901), 7 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:12,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:12,386 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:12,386 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 206 flow. Second operand 7 states and 901 transitions. [2023-08-29 20:31:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 416 flow [2023-08-29 20:31:12,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 370 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-29 20:31:12,391 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 216 flow [2023-08-29 20:31:12,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-29 20:31:12,392 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-29 20:31:12,392 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 216 flow [2023-08-29 20:31:12,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:12,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:12,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:12,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:12,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:12,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash 637630971, now seen corresponding path program 1 times [2023-08-29 20:31:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552828077] [2023-08-29 20:31:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:12,603 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:12,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:31:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:12,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:31:12,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:13,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:13,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552828077] [2023-08-29 20:31:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552828077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934159651] [2023-08-29 20:31:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:13,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:13,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2023-08-29 20:31:13,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:13,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:13,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2023-08-29 20:31:13,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:13,763 INFO L130 PetriNetUnfolder]: 443/737 cut-off events. [2023-08-29 20:31:13,763 INFO L131 PetriNetUnfolder]: For 1182/1182 co-relation queries the response was YES. [2023-08-29 20:31:13,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 737 events. 443/737 cut-off events. For 1182/1182 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3433 event pairs, 2 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 2284. Up to 559 conditions per place. [2023-08-29 20:31:13,767 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-08-29 20:31:13,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 450 flow [2023-08-29 20:31:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-08-29 20:31:13,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226415094339623 [2023-08-29 20:31:13,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-08-29 20:31:13,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-08-29 20:31:13,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:13,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-08-29 20:31:13,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:13,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:13,772 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:13,772 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 216 flow. Second operand 6 states and 672 transitions. [2023-08-29 20:31:13,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 450 flow [2023-08-29 20:31:13,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 296 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-29 20:31:13,775 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 124 flow [2023-08-29 20:31:13,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-29 20:31:13,775 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-29 20:31:13,775 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 124 flow [2023-08-29 20:31:13,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:13,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:13,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:13,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-29 20:31:13,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:13,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:13,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1144150194, now seen corresponding path program 1 times [2023-08-29 20:31:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176298210] [2023-08-29 20:31:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:14,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:14,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:31:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:14,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:14,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:14,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:14,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176298210] [2023-08-29 20:31:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176298210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172842130] [2023-08-29 20:31:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:14,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:14,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:14,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 265 [2023-08-29 20:31:14,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:14,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 265 [2023-08-29 20:31:14,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:14,362 INFO L130 PetriNetUnfolder]: 632/1072 cut-off events. [2023-08-29 20:31:14,363 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2023-08-29 20:31:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 1072 events. 632/1072 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5589 event pairs, 99 based on Foata normal form. 1/1069 useless extension candidates. Maximal degree in co-relation 2555. Up to 570 conditions per place. [2023-08-29 20:31:14,366 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 47 selfloop transitions, 1 changer transitions 31/82 dead transitions. [2023-08-29 20:31:14,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 431 flow [2023-08-29 20:31:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-29 20:31:14,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49433962264150944 [2023-08-29 20:31:14,368 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-29 20:31:14,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-29 20:31:14,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:14,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-29 20:31:14,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,371 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 124 flow. Second operand 5 states and 655 transitions. [2023-08-29 20:31:14,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 431 flow [2023-08-29 20:31:14,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 419 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:14,373 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 126 flow [2023-08-29 20:31:14,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-29 20:31:14,374 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-29 20:31:14,374 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 126 flow [2023-08-29 20:31:14,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:14,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:14,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:14,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:14,583 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:14,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash 876129604, now seen corresponding path program 2 times [2023-08-29 20:31:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:14,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943950585] [2023-08-29 20:31:14,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:31:14,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:14,588 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:14,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:31:14,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:31:14,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:14,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:14,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:14,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:14,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943950585] [2023-08-29 20:31:14,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943950585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:14,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501295721] [2023-08-29 20:31:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:14,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:14,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 265 [2023-08-29 20:31:14,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:14,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 265 [2023-08-29 20:31:14,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:14,971 INFO L130 PetriNetUnfolder]: 840/1360 cut-off events. [2023-08-29 20:31:14,972 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2023-08-29 20:31:14,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 1360 events. 840/1360 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7079 event pairs, 398 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 3460. Up to 816 conditions per place. [2023-08-29 20:31:14,976 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 45 selfloop transitions, 2 changer transitions 18/68 dead transitions. [2023-08-29 20:31:14,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 356 flow [2023-08-29 20:31:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:31:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:31:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-29 20:31:14,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:31:14,978 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-29 20:31:14,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-29 20:31:14,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:14,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-29 20:31:14,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,981 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,981 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 126 flow. Second operand 4 states and 530 transitions. [2023-08-29 20:31:14,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 356 flow [2023-08-29 20:31:14,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 349 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:31:14,983 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 131 flow [2023-08-29 20:31:14,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-29 20:31:14,984 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-29 20:31:14,984 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 131 flow [2023-08-29 20:31:14,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:14,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:14,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:15,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-29 20:31:15,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:15,193 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:15,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash -985584434, now seen corresponding path program 3 times [2023-08-29 20:31:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193793548] [2023-08-29 20:31:15,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:31:15,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:15,197 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:15,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:31:15,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:31:15,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:15,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:15,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:15,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:15,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:15,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193793548] [2023-08-29 20:31:15,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193793548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:15,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:15,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:15,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258211519] [2023-08-29 20:31:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:15,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:15,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:15,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:15,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:15,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 265 [2023-08-29 20:31:15,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:15,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:15,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 265 [2023-08-29 20:31:15,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:15,670 INFO L130 PetriNetUnfolder]: 569/999 cut-off events. [2023-08-29 20:31:15,670 INFO L131 PetriNetUnfolder]: For 270/271 co-relation queries the response was YES. [2023-08-29 20:31:15,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 999 events. 569/999 cut-off events. For 270/271 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4936 event pairs, 73 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 2618. Up to 514 conditions per place. [2023-08-29 20:31:15,673 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 44 selfloop transitions, 1 changer transitions 30/78 dead transitions. [2023-08-29 20:31:15,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 78 transitions, 422 flow [2023-08-29 20:31:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-29 20:31:15,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913207547169811 [2023-08-29 20:31:15,675 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-29 20:31:15,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-29 20:31:15,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:15,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-29 20:31:15,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:15,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:15,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:15,678 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 131 flow. Second operand 5 states and 651 transitions. [2023-08-29 20:31:15,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 78 transitions, 422 flow [2023-08-29 20:31:15,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 410 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:31:15,679 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 132 flow [2023-08-29 20:31:15,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-29 20:31:15,680 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-29 20:31:15,680 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 132 flow [2023-08-29 20:31:15,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:15,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:15,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:15,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:15,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:15,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:15,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1035844330, now seen corresponding path program 4 times [2023-08-29 20:31:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:15,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895450394] [2023-08-29 20:31:15,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:31:15,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:15,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:15,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:15,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:31:15,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:31:15,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:15,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 20:31:15,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:16,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:16,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895450394] [2023-08-29 20:31:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895450394] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:31:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337141922] [2023-08-29 20:31:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:31:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:31:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:31:16,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 265 [2023-08-29 20:31:16,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:16,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:16,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 265 [2023-08-29 20:31:16,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:16,306 INFO L130 PetriNetUnfolder]: 559/949 cut-off events. [2023-08-29 20:31:16,306 INFO L131 PetriNetUnfolder]: For 500/503 co-relation queries the response was YES. [2023-08-29 20:31:16,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 949 events. 559/949 cut-off events. For 500/503 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4440 event pairs, 175 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 2518. Up to 485 conditions per place. [2023-08-29 20:31:16,308 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 42 selfloop transitions, 3 changer transitions 16/64 dead transitions. [2023-08-29 20:31:16,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 345 flow [2023-08-29 20:31:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-29 20:31:16,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890566037735849 [2023-08-29 20:31:16,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-29 20:31:16,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-29 20:31:16,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:16,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-29 20:31:16,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:16,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:16,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:16,313 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 132 flow. Second operand 5 states and 648 transitions. [2023-08-29 20:31:16,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 345 flow [2023-08-29 20:31:16,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 338 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:31:16,315 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 139 flow [2023-08-29 20:31:16,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-29 20:31:16,315 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-08-29 20:31:16,315 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 139 flow [2023-08-29 20:31:16,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:16,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:16,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:16,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:16,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:16,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:16,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1342833196, now seen corresponding path program 5 times [2023-08-29 20:31:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:16,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105536490] [2023-08-29 20:31:16,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:31:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:16,526 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:16,528 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 (13)] Waiting until timeout for monitored process [2023-08-29 20:31:16,629 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:31:16,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:31:16,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:31:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:16,729 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:31:16,729 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:31:16,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:31:16,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:31:16,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:31:16,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:31:16,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:31:16,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:31:16,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:31:16,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:31:16,743 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 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:16,941 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:16,945 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:31:16,945 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:31:17,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:31:17 BasicIcfg [2023-08-29 20:31:17,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:31:17,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:31:17,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:31:17,015 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:31:17,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:02" (3/4) ... [2023-08-29 20:31:17,017 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:31:17,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:31:17,018 INFO L158 Benchmark]: Toolchain (without parser) took 15468.22ms. Allocated memory was 102.8MB in the beginning and 375.4MB in the end (delta: 272.6MB). Free memory was 79.9MB in the beginning and 244.2MB in the end (delta: -164.2MB). Peak memory consumption was 110.8MB. Max. memory is 16.1GB. [2023-08-29 20:31:17,018 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:17,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.55ms. Allocated memory is still 102.8MB. Free memory was 79.6MB in the beginning and 55.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-29 20:31:17,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.22ms. Allocated memory is still 102.8MB. Free memory was 55.4MB in the beginning and 52.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:31:17,019 INFO L158 Benchmark]: Boogie Preprocessor took 32.83ms. Allocated memory is still 102.8MB. Free memory was 52.7MB in the beginning and 81.8MB in the end (delta: -29.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-29 20:31:17,019 INFO L158 Benchmark]: RCFGBuilder took 628.54ms. Allocated memory is still 102.8MB. Free memory was 81.8MB in the beginning and 77.3MB in the end (delta: 4.5MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2023-08-29 20:31:17,020 INFO L158 Benchmark]: TraceAbstraction took 14249.77ms. Allocated memory was 102.8MB in the beginning and 375.4MB in the end (delta: 272.6MB). Free memory was 76.7MB in the beginning and 244.2MB in the end (delta: -167.5MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2023-08-29 20:31:17,020 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 375.4MB. Free memory is still 244.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:17,021 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.14ms. Allocated memory is still 69.2MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.55ms. Allocated memory is still 102.8MB. Free memory was 79.6MB in the beginning and 55.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.22ms. Allocated memory is still 102.8MB. Free memory was 55.4MB in the beginning and 52.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.83ms. Allocated memory is still 102.8MB. Free memory was 52.7MB in the beginning and 81.8MB in the end (delta: -29.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 628.54ms. Allocated memory is still 102.8MB. Free memory was 81.8MB in the beginning and 77.3MB in the end (delta: 4.5MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14249.77ms. Allocated memory was 102.8MB in the beginning and 375.4MB in the end (delta: 272.6MB). Free memory was 76.7MB in the beginning and 244.2MB in the end (delta: -167.5MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 375.4MB. Free memory is still 244.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 146 PlacesBefore, 51 PlacesAfterwards, 135 TransitionsBefore, 39 TransitionsAfterwards, 3046 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 7882 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3959, independent: 3756, independent conditional: 0, independent unconditional: 3756, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1597, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3959, independent: 2190, independent conditional: 0, independent unconditional: 2190, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1597, unknown conditional: 0, unknown unconditional: 1597] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=0, t1461={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=1, t1461={3:0}, t1462={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=2, t1461={3:0}, t1462={7:0}, t1463={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=3, t1461={3:0}, t1462={7:0}, t1463={11:0}, t1464={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={3:0}, t1462={7:0}, t1463={11:0}, t1464={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={3:0}, t1462={7:0}, t1463={11:0}, t1464={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 843]: 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: 841]: 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: 839]: 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 9 procedures, 173 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1651 IncrementalHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 36 mSDtfsCounter, 1651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 196 ConstructedInterpolants, 20 QuantifiedInterpolants, 1723 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1702 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:31:17,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample