./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:19:14,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:19:14,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:19:14,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:19:14,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:19:14,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:19:14,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:19:14,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:19:14,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:19:14,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:19:14,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:19:14,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:19:14,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:19:14,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:19:14,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:19:14,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:19:14,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:19:14,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:19:14,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:19:14,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:19:14,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:19:14,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:19:14,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:19:14,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:19:14,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:19:14,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:19:14,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:19:14,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:19:14,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:19:14,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:19:14,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:19:14,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:19:14,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:19:14,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:19:14,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:19:14,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:19:14,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:19:14,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:19:14,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:19:15,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:19:15,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:19:15,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:19:15,041 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:19:15,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:19:15,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:19:15,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:19:15,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:19:15,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:19:15,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:19:15,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:19:15,045 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:19:15,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:19:15,046 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:19:15,046 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:19:15,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:19:15,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:19:15,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:19:15,047 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:19:15,047 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:19:15,047 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:19:15,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:19:15,048 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:19:15,048 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:19:15,048 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:19:15,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:19:15,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:19:15,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:19:15,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:19:15,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:19:15,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:19:15,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:19:15,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:19:15,050 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:19:15,050 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:19:15,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:19:15,051 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:19:15,051 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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:19:15,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:19:15,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:19:15,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:19:15,383 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:19:15,383 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:19:15,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-31 23:19:16,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:19:16,771 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:19:16,772 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-31 23:19:16,785 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f31d31d/a005cc7513d9435b8a0207845b7de12f/FLAGfc8c5b2e1 [2023-08-31 23:19:16,799 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f31d31d/a005cc7513d9435b8a0207845b7de12f [2023-08-31 23:19:16,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:19:16,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:19:16,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:19:16,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:19:16,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:19:16,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:19:16" (1/1) ... [2023-08-31 23:19:16,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619c60bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:16, skipping insertion in model container [2023-08-31 23:19:16,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:19:16" (1/1) ... [2023-08-31 23:19:16,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:19:16,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:19:17,054 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-31 23:19:17,279 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:19:17,291 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:19:17,303 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-31 23:19:17,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:19:17,399 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:19:17,402 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:19:17,407 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:19:17,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17 WrapperNode [2023-08-31 23:19:17,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:19:17,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:19:17,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:19:17,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:19:17,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,482 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-31 23:19:17,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:19:17,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:19:17,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:19:17,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:19:17,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,532 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:19:17,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:19:17,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:19:17,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:19:17,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (1/1) ... [2023-08-31 23:19:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:19:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:19:17,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:19:17,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:19:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:19:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:19:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:19:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:19:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:19:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:19:17,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:19:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:19:17,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:19:17,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:19:17,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:19:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:19:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:19:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:19:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:19:17,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:19:17,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:19:17,626 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:19:17,806 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:19:17,807 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:19:18,115 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:19:18,245 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:19:18,246 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:19:18,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:19:18 BoogieIcfgContainer [2023-08-31 23:19:18,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:19:18,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:19:18,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:19:18,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:19:18,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:19:16" (1/3) ... [2023-08-31 23:19:18,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d95d3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:19:18, skipping insertion in model container [2023-08-31 23:19:18,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:17" (2/3) ... [2023-08-31 23:19:18,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d95d3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:19:18, skipping insertion in model container [2023-08-31 23:19:18,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:19:18" (3/3) ... [2023-08-31 23:19:18,255 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-31 23:19:18,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:19:18,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:19:18,272 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:19:18,358 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:19:18,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:19:18,473 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:19:18,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:18,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:19:18,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:19:18,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:19:18,496 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:19:18,511 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:19:18,519 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:19:18,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:19:18,567 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:19:18,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:18,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:19:18,572 INFO L119 LiptonReduction]: Number of co-enabled transitions 3128 [2023-08-31 23:19:23,217 INFO L134 LiptonReduction]: Checked pairs total: 7350 [2023-08-31 23:19:23,218 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-08-31 23:19:23,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:19:23,235 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;@6ffca4cd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:19:23,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:19:23,237 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:19:23,237 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:23,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:23,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:19:23,239 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-31 23:19:23,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:23,247 INFO L85 PathProgramCache]: Analyzing trace with hash 573, now seen corresponding path program 1 times [2023-08-31 23:19:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414018724] [2023-08-31 23:19:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414018724] [2023-08-31 23:19:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414018724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:19:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107850785] [2023-08-31 23:19:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:23,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:19:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:23,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:19:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:19:23,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 272 [2023-08-31 23:19:23,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:23,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:23,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 272 [2023-08-31 23:19:23,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:24,201 INFO L130 PetriNetUnfolder]: 4373/6097 cut-off events. [2023-08-31 23:19:24,201 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-31 23:19:24,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12183 conditions, 6097 events. 4373/6097 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30942 event pairs, 4373 based on Foata normal form. 0/5373 useless extension candidates. Maximal degree in co-relation 12171. Up to 5983 conditions per place. [2023-08-31 23:19:24,243 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-31 23:19:24,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-31 23:19:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:19:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:19:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:19:24,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459558823529411 [2023-08-31 23:19:24,263 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:19:24,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:19:24,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:24,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:19:24,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:24,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:24,281 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:24,282 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:19:24,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-31 23:19:24,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:19:24,291 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-31 23:19:24,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-31 23:19:24,296 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-31 23:19:24,297 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-31 23:19:24,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:24,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:24,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:24,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:19:24,298 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-31 23:19:24,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1315010726, now seen corresponding path program 1 times [2023-08-31 23:19:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171599211] [2023-08-31 23:19:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:24,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:24,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171599211] [2023-08-31 23:19:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171599211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:24,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:19:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691897132] [2023-08-31 23:19:24,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:24,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:19:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:19:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:19:24,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 272 [2023-08-31 23:19:24,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:24,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:24,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 272 [2023-08-31 23:19:24,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:25,125 INFO L130 PetriNetUnfolder]: 3632/5248 cut-off events. [2023-08-31 23:19:25,125 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:25,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28109 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-08-31 23:19:25,156 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-31 23:19:25,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-08-31 23:19:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:19:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:19:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-31 23:19:25,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257352941176471 [2023-08-31 23:19:25,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-31 23:19:25,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-31 23:19:25,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:25,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-31 23:19:25,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:25,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:25,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:25,166 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 429 transitions. [2023-08-31 23:19:25,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-08-31 23:19:25,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:19:25,168 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-31 23:19:25,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-31 23:19:25,169 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-31 23:19:25,169 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-31 23:19:25,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:25,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:25,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:25,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:19:25,171 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-31 23:19:25,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1085690766, now seen corresponding path program 1 times [2023-08-31 23:19:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757339486] [2023-08-31 23:19:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757339486] [2023-08-31 23:19:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757339486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:19:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277528063] [2023-08-31 23:19:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:25,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:19:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:25,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:19:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:19:26,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-31 23:19:26,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:26,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:26,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-31 23:19:26,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:26,651 INFO L130 PetriNetUnfolder]: 2594/3775 cut-off events. [2023-08-31 23:19:26,651 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-31 23:19:26,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7649 conditions, 3775 events. 2594/3775 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19241 event pairs, 156 based on Foata normal form. 0/3775 useless extension candidates. Maximal degree in co-relation 7645. Up to 2097 conditions per place. [2023-08-31 23:19:26,677 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 42 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-31 23:19:26,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 206 flow [2023-08-31 23:19:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-31 23:19:26,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-08-31 23:19:26,682 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-31 23:19:26,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-31 23:19:26,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:26,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-31 23:19:26,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:26,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:26,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:26,689 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 7 states and 840 transitions. [2023-08-31 23:19:26,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 206 flow [2023-08-31 23:19:26,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:19:26,693 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 70 flow [2023-08-31 23:19:26,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-31 23:19:26,695 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2023-08-31 23:19:26,698 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 70 flow [2023-08-31 23:19:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:26,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:26,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:26,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:19:26,699 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-31 23:19:26,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1085690848, now seen corresponding path program 1 times [2023-08-31 23:19:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737701510] [2023-08-31 23:19:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:26,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737701510] [2023-08-31 23:19:26,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737701510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:26,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:26,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:19:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95684895] [2023-08-31 23:19:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:26,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:19:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:19:26,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:19:26,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 272 [2023-08-31 23:19:26,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:26,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:26,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 272 [2023-08-31 23:19:26,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:27,786 INFO L130 PetriNetUnfolder]: 6567/9008 cut-off events. [2023-08-31 23:19:27,786 INFO L131 PetriNetUnfolder]: For 429/429 co-relation queries the response was YES. [2023-08-31 23:19:27,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18643 conditions, 9008 events. 6567/9008 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 41347 event pairs, 2759 based on Foata normal form. 384/9392 useless extension candidates. Maximal degree in co-relation 18639. Up to 7617 conditions per place. [2023-08-31 23:19:27,843 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 37 selfloop transitions, 5 changer transitions 23/65 dead transitions. [2023-08-31 23:19:27,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 296 flow [2023-08-31 23:19:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-31 23:19:27,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48308823529411765 [2023-08-31 23:19:27,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-31 23:19:27,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-31 23:19:27,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:27,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-31 23:19:27,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:27,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:27,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:27,852 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 70 flow. Second operand 5 states and 657 transitions. [2023-08-31 23:19:27,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 296 flow [2023-08-31 23:19:27,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 278 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:19:27,854 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 107 flow [2023-08-31 23:19:27,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-31 23:19:27,855 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-31 23:19:27,855 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 107 flow [2023-08-31 23:19:27,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:27,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:27,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:27,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:19:27,857 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-31 23:19:27,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash -558867073, now seen corresponding path program 1 times [2023-08-31 23:19:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596096437] [2023-08-31 23:19:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:28,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:28,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596096437] [2023-08-31 23:19:28,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596096437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:28,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:28,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:19:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446726127] [2023-08-31 23:19:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:28,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:19:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:19:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:19:28,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-31 23:19:28,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:28,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:28,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-31 23:19:28,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:28,552 INFO L130 PetriNetUnfolder]: 4025/5911 cut-off events. [2023-08-31 23:19:28,553 INFO L131 PetriNetUnfolder]: For 2543/2665 co-relation queries the response was YES. [2023-08-31 23:19:28,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14449 conditions, 5911 events. 4025/5911 cut-off events. For 2543/2665 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 30998 event pairs, 1263 based on Foata normal form. 280/6059 useless extension candidates. Maximal degree in co-relation 14442. Up to 3211 conditions per place. [2023-08-31 23:19:28,601 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 31 selfloop transitions, 3 changer transitions 19/58 dead transitions. [2023-08-31 23:19:28,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 288 flow [2023-08-31 23:19:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-31 23:19:28,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985294117647059 [2023-08-31 23:19:28,604 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-31 23:19:28,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-31 23:19:28,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:28,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-31 23:19:28,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:28,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:28,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:28,610 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 107 flow. Second operand 5 states and 678 transitions. [2023-08-31 23:19:28,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 288 flow [2023-08-31 23:19:28,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 281 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:19:28,634 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 115 flow [2023-08-31 23:19:28,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-31 23:19:28,636 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-31 23:19:28,637 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 115 flow [2023-08-31 23:19:28,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:28,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:28,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:28,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:19:28,638 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-31 23:19:28,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 264753207, now seen corresponding path program 1 times [2023-08-31 23:19:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595166486] [2023-08-31 23:19:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595166486] [2023-08-31 23:19:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595166486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:28,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:19:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992334234] [2023-08-31 23:19:28,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:28,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:19:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:28,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:19:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:19:28,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-31 23:19:28,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:28,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:28,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-31 23:19:28,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:29,291 INFO L130 PetriNetUnfolder]: 2995/4441 cut-off events. [2023-08-31 23:19:29,291 INFO L131 PetriNetUnfolder]: For 3053/3183 co-relation queries the response was YES. [2023-08-31 23:19:29,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 4441 events. 2995/4441 cut-off events. For 3053/3183 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23159 event pairs, 614 based on Foata normal form. 296/4630 useless extension candidates. Maximal degree in co-relation 11603. Up to 3038 conditions per place. [2023-08-31 23:19:29,319 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 56 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2023-08-31 23:19:29,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 383 flow [2023-08-31 23:19:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-31 23:19:29,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-31 23:19:29,322 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-31 23:19:29,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-31 23:19:29,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:29,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-31 23:19:29,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:29,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:29,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:29,326 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 115 flow. Second operand 5 states and 690 transitions. [2023-08-31 23:19:29,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 383 flow [2023-08-31 23:19:29,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 365 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:19:29,337 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 174 flow [2023-08-31 23:19:29,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-31 23:19:29,341 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-31 23:19:29,341 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 174 flow [2023-08-31 23:19:29,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:29,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:29,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:19:29,342 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-31 23:19:29,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1220523580, now seen corresponding path program 1 times [2023-08-31 23:19:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299088453] [2023-08-31 23:19:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:29,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299088453] [2023-08-31 23:19:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299088453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263465314] [2023-08-31 23:19:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:29,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:29,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:29,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:29,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-31 23:19:29,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:29,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:29,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-31 23:19:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:30,008 INFO L130 PetriNetUnfolder]: 2121/3316 cut-off events. [2023-08-31 23:19:30,009 INFO L131 PetriNetUnfolder]: For 2989/3108 co-relation queries the response was YES. [2023-08-31 23:19:30,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10859 conditions, 3316 events. 2121/3316 cut-off events. For 2989/3108 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17743 event pairs, 256 based on Foata normal form. 221/3455 useless extension candidates. Maximal degree in co-relation 10849. Up to 1218 conditions per place. [2023-08-31 23:19:30,031 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 74 selfloop transitions, 17 changer transitions 2/98 dead transitions. [2023-08-31 23:19:30,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 596 flow [2023-08-31 23:19:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 966 transitions. [2023-08-31 23:19:30,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2023-08-31 23:19:30,035 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 966 transitions. [2023-08-31 23:19:30,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 966 transitions. [2023-08-31 23:19:30,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:30,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 966 transitions. [2023-08-31 23:19:30,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,041 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,041 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 174 flow. Second operand 7 states and 966 transitions. [2023-08-31 23:19:30,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 596 flow [2023-08-31 23:19:30,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:19:30,049 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 290 flow [2023-08-31 23:19:30,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-31 23:19:30,050 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-31 23:19:30,050 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 290 flow [2023-08-31 23:19:30,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:30,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:30,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:19:30,051 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-31 23:19:30,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2070491185, now seen corresponding path program 1 times [2023-08-31 23:19:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806440466] [2023-08-31 23:19:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806440466] [2023-08-31 23:19:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806440466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:30,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:30,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:19:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804605991] [2023-08-31 23:19:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:30,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:19:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:19:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:19:30,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-31 23:19:30,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:30,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-31 23:19:30,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:30,903 INFO L130 PetriNetUnfolder]: 3904/5896 cut-off events. [2023-08-31 23:19:30,904 INFO L131 PetriNetUnfolder]: For 13554/13554 co-relation queries the response was YES. [2023-08-31 23:19:30,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22945 conditions, 5896 events. 3904/5896 cut-off events. For 13554/13554 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 31288 event pairs, 502 based on Foata normal form. 39/5935 useless extension candidates. Maximal degree in co-relation 22932. Up to 3265 conditions per place. [2023-08-31 23:19:30,940 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 82 selfloop transitions, 10 changer transitions 51/143 dead transitions. [2023-08-31 23:19:30,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 143 transitions, 1151 flow [2023-08-31 23:19:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2023-08-31 23:19:30,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789915966386555 [2023-08-31 23:19:30,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2023-08-31 23:19:30,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2023-08-31 23:19:30,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:30,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2023-08-31 23:19:30,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,950 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:30,950 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 290 flow. Second operand 7 states and 912 transitions. [2023-08-31 23:19:30,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 143 transitions, 1151 flow [2023-08-31 23:19:31,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 143 transitions, 1027 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-31 23:19:31,027 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 241 flow [2023-08-31 23:19:31,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-08-31 23:19:31,028 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-31 23:19:31,028 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 241 flow [2023-08-31 23:19:31,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:31,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:31,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:19:31,029 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-31 23:19:31,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1287139509, now seen corresponding path program 2 times [2023-08-31 23:19:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792557336] [2023-08-31 23:19:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792557336] [2023-08-31 23:19:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792557336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:19:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476241858] [2023-08-31 23:19:31,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:31,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:19:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:19:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:19:31,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-31 23:19:31,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:31,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-31 23:19:31,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:31,533 INFO L130 PetriNetUnfolder]: 1251/2045 cut-off events. [2023-08-31 23:19:31,534 INFO L131 PetriNetUnfolder]: For 3997/4173 co-relation queries the response was YES. [2023-08-31 23:19:31,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7379 conditions, 2045 events. 1251/2045 cut-off events. For 3997/4173 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10674 event pairs, 195 based on Foata normal form. 188/2172 useless extension candidates. Maximal degree in co-relation 7363. Up to 646 conditions per place. [2023-08-31 23:19:31,544 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 66 selfloop transitions, 15 changer transitions 15/102 dead transitions. [2023-08-31 23:19:31,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 730 flow [2023-08-31 23:19:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2023-08-31 23:19:31,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084033613445378 [2023-08-31 23:19:31,547 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2023-08-31 23:19:31,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2023-08-31 23:19:31,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:31,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2023-08-31 23:19:31,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,553 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,553 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 241 flow. Second operand 7 states and 968 transitions. [2023-08-31 23:19:31,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 730 flow [2023-08-31 23:19:31,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 683 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-31 23:19:31,562 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 326 flow [2023-08-31 23:19:31,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-08-31 23:19:31,563 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-31 23:19:31,563 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 326 flow [2023-08-31 23:19:31,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:31,564 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] [2023-08-31 23:19:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:19:31,564 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-31 23:19:31,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1928409831, now seen corresponding path program 1 times [2023-08-31 23:19:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078835935] [2023-08-31 23:19:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078835935] [2023-08-31 23:19:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078835935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:31,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:31,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074739776] [2023-08-31 23:19:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:31,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:31,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:31,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:31,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 272 [2023-08-31 23:19:31,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:31,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:31,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 272 [2023-08-31 23:19:31,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:32,235 INFO L130 PetriNetUnfolder]: 2278/3653 cut-off events. [2023-08-31 23:19:32,236 INFO L131 PetriNetUnfolder]: For 9061/9061 co-relation queries the response was YES. [2023-08-31 23:19:32,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14766 conditions, 3653 events. 2278/3653 cut-off events. For 9061/9061 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19344 event pairs, 160 based on Foata normal form. 16/3669 useless extension candidates. Maximal degree in co-relation 14750. Up to 2169 conditions per place. [2023-08-31 23:19:32,256 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 91 selfloop transitions, 16 changer transitions 25/132 dead transitions. [2023-08-31 23:19:32,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 132 transitions, 1165 flow [2023-08-31 23:19:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-31 23:19:32,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737394957983193 [2023-08-31 23:19:32,259 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-31 23:19:32,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-31 23:19:32,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:32,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-31 23:19:32,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,265 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,265 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 326 flow. Second operand 7 states and 902 transitions. [2023-08-31 23:19:32,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 132 transitions, 1165 flow [2023-08-31 23:19:32,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 1035 flow, removed 48 selfloop flow, removed 2 redundant places. [2023-08-31 23:19:32,316 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 399 flow [2023-08-31 23:19:32,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-31 23:19:32,317 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2023-08-31 23:19:32,317 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 399 flow [2023-08-31 23:19:32,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:32,318 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] [2023-08-31 23:19:32,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:19:32,318 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-31 23:19:32,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash 388900549, now seen corresponding path program 2 times [2023-08-31 23:19:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:32,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023107035] [2023-08-31 23:19:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:32,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:32,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023107035] [2023-08-31 23:19:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023107035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:32,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:19:32,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061354546] [2023-08-31 23:19:32,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:32,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:19:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:19:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:19:32,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-31 23:19:32,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 399 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:32,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-31 23:19:32,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:32,942 INFO L130 PetriNetUnfolder]: 1405/2291 cut-off events. [2023-08-31 23:19:32,942 INFO L131 PetriNetUnfolder]: For 6042/6516 co-relation queries the response was YES. [2023-08-31 23:19:32,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9111 conditions, 2291 events. 1405/2291 cut-off events. For 6042/6516 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12519 event pairs, 191 based on Foata normal form. 197/2411 useless extension candidates. Maximal degree in co-relation 9089. Up to 810 conditions per place. [2023-08-31 23:19:32,953 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 61 selfloop transitions, 18 changer transitions 22/108 dead transitions. [2023-08-31 23:19:32,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 917 flow [2023-08-31 23:19:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:19:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:19:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1082 transitions. [2023-08-31 23:19:32,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49724264705882354 [2023-08-31 23:19:32,959 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1082 transitions. [2023-08-31 23:19:32,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1082 transitions. [2023-08-31 23:19:32,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:32,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1082 transitions. [2023-08-31 23:19:32,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.25) internal successors, (1082), 8 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,966 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:32,967 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 399 flow. Second operand 8 states and 1082 transitions. [2023-08-31 23:19:32,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 917 flow [2023-08-31 23:19:33,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 840 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-08-31 23:19:33,012 INFO L231 Difference]: Finished difference. Result has 72 places, 49 transitions, 354 flow [2023-08-31 23:19:33,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=354, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2023-08-31 23:19:33,012 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-31 23:19:33,013 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 354 flow [2023-08-31 23:19:33,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:33,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:33,014 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-31 23:19:33,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:19:33,014 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-31 23:19:33,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2023308035, now seen corresponding path program 1 times [2023-08-31 23:19:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117941440] [2023-08-31 23:19:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117941440] [2023-08-31 23:19:33,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117941440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:33,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:19:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047701502] [2023-08-31 23:19:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:33,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:19:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:33,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:19:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:19:33,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-31 23:19:33,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 354 flow. Second operand has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:33,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:33,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-31 23:19:33,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:34,026 INFO L130 PetriNetUnfolder]: 1487/2479 cut-off events. [2023-08-31 23:19:34,026 INFO L131 PetriNetUnfolder]: For 8304/8385 co-relation queries the response was YES. [2023-08-31 23:19:34,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10650 conditions, 2479 events. 1487/2479 cut-off events. For 8304/8385 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13662 event pairs, 186 based on Foata normal form. 10/2466 useless extension candidates. Maximal degree in co-relation 10628. Up to 727 conditions per place. [2023-08-31 23:19:34,040 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 40 selfloop transitions, 3 changer transitions 119/165 dead transitions. [2023-08-31 23:19:34,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 165 transitions, 1549 flow [2023-08-31 23:19:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:19:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:19:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1172 transitions. [2023-08-31 23:19:34,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47875816993464054 [2023-08-31 23:19:34,044 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1172 transitions. [2023-08-31 23:19:34,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1172 transitions. [2023-08-31 23:19:34,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:34,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1172 transitions. [2023-08-31 23:19:34,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.22222222222223) internal successors, (1172), 9 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,053 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,053 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 354 flow. Second operand 9 states and 1172 transitions. [2023-08-31 23:19:34,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 165 transitions, 1549 flow [2023-08-31 23:19:34,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 165 transitions, 1262 flow, removed 69 selfloop flow, removed 11 redundant places. [2023-08-31 23:19:34,086 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 233 flow [2023-08-31 23:19:34,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=233, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2023-08-31 23:19:34,087 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-31 23:19:34,087 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 233 flow [2023-08-31 23:19:34,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:34,088 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-31 23:19:34,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:19:34,088 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-31 23:19:34,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1987068821, now seen corresponding path program 2 times [2023-08-31 23:19:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750295096] [2023-08-31 23:19:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750295096] [2023-08-31 23:19:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750295096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453371898] [2023-08-31 23:19:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:34,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-31 23:19:34,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:34,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-31 23:19:34,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:34,497 INFO L130 PetriNetUnfolder]: 579/1004 cut-off events. [2023-08-31 23:19:34,497 INFO L131 PetriNetUnfolder]: For 2115/2115 co-relation queries the response was YES. [2023-08-31 23:19:34,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1004 events. 579/1004 cut-off events. For 2115/2115 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4963 event pairs, 163 based on Foata normal form. 1/977 useless extension candidates. Maximal degree in co-relation 3745. Up to 483 conditions per place. [2023-08-31 23:19:34,502 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 45 selfloop transitions, 1 changer transitions 30/78 dead transitions. [2023-08-31 23:19:34,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 580 flow [2023-08-31 23:19:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-31 23:19:34,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860294117647059 [2023-08-31 23:19:34,505 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-31 23:19:34,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-31 23:19:34,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:34,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-31 23:19:34,507 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-31 23:19:34,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,510 INFO L175 Difference]: Start difference. First operand has 71 places, 42 transitions, 233 flow. Second operand 5 states and 661 transitions. [2023-08-31 23:19:34,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 580 flow [2023-08-31 23:19:34,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 556 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-31 23:19:34,521 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 194 flow [2023-08-31 23:19:34,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-08-31 23:19:34,522 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-31 23:19:34,522 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 194 flow [2023-08-31 23:19:34,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:34,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:34,523 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-31 23:19:34,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:19:34,523 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-31 23:19:34,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1512970711, now seen corresponding path program 3 times [2023-08-31 23:19:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042668500] [2023-08-31 23:19:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:19:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042668500] [2023-08-31 23:19:35,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042668500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:35,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:35,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:19:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187021740] [2023-08-31 23:19:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:35,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:19:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:19:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:19:35,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:19:35,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-31 23:19:35,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:35,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:35,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-31 23:19:35,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:35,567 INFO L130 PetriNetUnfolder]: 388/691 cut-off events. [2023-08-31 23:19:35,567 INFO L131 PetriNetUnfolder]: For 1503/1505 co-relation queries the response was YES. [2023-08-31 23:19:35,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 691 events. 388/691 cut-off events. For 1503/1505 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3338 event pairs, 87 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 2466. Up to 302 conditions per place. [2023-08-31 23:19:35,570 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 41 selfloop transitions, 3 changer transitions 25/72 dead transitions. [2023-08-31 23:19:35,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 72 transitions, 525 flow [2023-08-31 23:19:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-08-31 23:19:35,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695378151260504 [2023-08-31 23:19:35,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-08-31 23:19:35,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-08-31 23:19:35,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:35,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-08-31 23:19:35,578 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-31 23:19:35,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:35,582 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:35,582 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 194 flow. Second operand 7 states and 894 transitions. [2023-08-31 23:19:35,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 72 transitions, 525 flow [2023-08-31 23:19:35,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 511 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 23:19:35,588 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 198 flow [2023-08-31 23:19:35,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=7, PETRI_FLOW=198, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2023-08-31 23:19:35,589 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-31 23:19:35,590 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 198 flow [2023-08-31 23:19:35,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:35,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:35,591 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-31 23:19:35,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:19:35,591 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-31 23:19:35,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1482363257, now seen corresponding path program 4 times [2023-08-31 23:19:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:19:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171146797] [2023-08-31 23:19:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:19:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:19:35,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:19:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:19:35,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:19:35,741 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:19:35,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:19:35,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:19:35,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:19:35,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:19:35,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:19:35,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:19:35,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:19:35,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:19:35,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:19:35,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:19:35,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:19:35,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:19:35,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:19:35,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:19:35,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:19:35,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:19:35,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:19:35,749 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:35,755 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:19:35,755 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:19:35,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:19:35 BasicIcfg [2023-08-31 23:19:35,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:19:35,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:19:35,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:19:35,848 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:19:35,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:19:18" (3/4) ... [2023-08-31 23:19:35,850 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:19:35,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:19:35,851 INFO L158 Benchmark]: Toolchain (without parser) took 19049.41ms. Allocated memory was 69.2MB in the beginning and 692.1MB in the end (delta: 622.9MB). Free memory was 35.8MB in the beginning and 295.3MB in the end (delta: -259.5MB). Peak memory consumption was 362.4MB. Max. memory is 16.1GB. [2023-08-31 23:19:35,851 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 32.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:19:35,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.77ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 30.1MB in the end (delta: 5.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-08-31 23:19:35,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.31ms. Allocated memory is still 69.2MB. Free memory was 30.1MB in the beginning and 27.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:19:35,852 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 69.2MB. Free memory was 27.5MB in the beginning and 47.6MB in the end (delta: -20.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:19:35,853 INFO L158 Benchmark]: RCFGBuilder took 710.88ms. Allocated memory is still 69.2MB. Free memory was 47.3MB in the beginning and 32.2MB in the end (delta: 15.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2023-08-31 23:19:35,853 INFO L158 Benchmark]: TraceAbstraction took 17597.51ms. Allocated memory was 69.2MB in the beginning and 692.1MB in the end (delta: 622.9MB). Free memory was 31.5MB in the beginning and 296.3MB in the end (delta: -264.8MB). Peak memory consumption was 358.0MB. Max. memory is 16.1GB. [2023-08-31 23:19:35,853 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 692.1MB. Free memory was 296.3MB in the beginning and 295.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:19:35,855 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.23ms. Allocated memory is still 54.5MB. Free memory was 32.3MB in the beginning and 32.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.77ms. Allocated memory is still 69.2MB. Free memory was 35.6MB in the beginning and 30.1MB in the end (delta: 5.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.31ms. Allocated memory is still 69.2MB. Free memory was 30.1MB in the beginning and 27.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 69.2MB. Free memory was 27.5MB in the beginning and 47.6MB in the end (delta: -20.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 710.88ms. Allocated memory is still 69.2MB. Free memory was 47.3MB in the beginning and 32.2MB in the end (delta: 15.1MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17597.51ms. Allocated memory was 69.2MB in the beginning and 692.1MB in the end (delta: 622.9MB). Free memory was 31.5MB in the beginning and 296.3MB in the end (delta: -264.8MB). Peak memory consumption was 358.0MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 692.1MB. Free memory was 296.3MB in the beginning and 295.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 150 PlacesBefore, 50 PlacesAfterwards, 139 TransitionsBefore, 38 TransitionsAfterwards, 3128 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 129 TotalNumberOfCompositions, 7350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4280, independent: 4089, independent conditional: 0, independent unconditional: 4089, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1665, independent: 1637, independent conditional: 0, independent unconditional: 1637, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4280, independent: 2452, independent conditional: 0, independent unconditional: 2452, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 1665, unknown conditional: 0, unknown unconditional: 1665] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-4, t949={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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-3, t949={5:0}, t950={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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=-2, t949={5:0}, t950={6:0}, t951={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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=-1, t949={5:0}, t950={6:0}, t951={7:0}, t952={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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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: 865]: 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, 178 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: 17.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 930 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 749 mSDsluCounter, 520 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 470 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2639 IncrementalHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 50 mSDtfsCounter, 2639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=10, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:19:35,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/mix036_pso.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:19:37,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:19:37,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:19:37,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:19:37,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:19:37,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:19:37,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:19:37,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:19:37,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:19:37,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:19:37,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:19:37,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:19:37,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:19:37,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:19:37,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:19:37,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:19:37,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:19:37,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:19:37,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:19:37,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:19:37,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:19:37,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:19:37,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:19:37,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:19:37,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:19:37,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:19:37,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:19:37,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:19:37,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:19:37,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:19:37,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:19:37,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:19:37,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:19:37,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:19:37,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:19:37,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:19:37,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:19:37,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:19:37,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:19:37,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:19:37,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:19:37,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:19:37,991 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:19:37,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:19:37,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:19:37,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:19:37,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:19:37,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:19:37,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:19:37,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:19:37,993 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:19:37,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:19:37,994 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:19:37,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:19:37,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:19:37,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:19:37,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:19:37,995 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:19:37,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:19:37,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:19:37,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:19:37,996 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:19:37,996 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:19:37,996 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:19:37,996 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:19:37,996 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:19:37,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:19:37,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:19:37,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:19:37,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:19:37,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:19:37,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:19:37,998 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:19:37,998 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:19:37,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:19:37,998 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:19:37,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:19:37,999 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:19:37,999 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:19:37,999 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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:19:38,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:19:38,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:19:38,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:19:38,344 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:19:38,345 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:19:38,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-31 23:19:39,435 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:19:39,720 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:19:39,721 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-31 23:19:39,733 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b74140547/36a888121b89434188f5ee45dd0ac688/FLAG99681676b [2023-08-31 23:19:39,750 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b74140547/36a888121b89434188f5ee45dd0ac688 [2023-08-31 23:19:39,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:19:39,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:19:39,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:19:39,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:19:39,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:19:39,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:19:39" (1/1) ... [2023-08-31 23:19:39,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ff877c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:39, skipping insertion in model container [2023-08-31 23:19:39,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:19:39" (1/1) ... [2023-08-31 23:19:39,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:19:39,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:19:39,994 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-31 23:19:40,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:19:40,236 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:19:40,246 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/mix036_pso.opt_tso.opt.i[956,969] [2023-08-31 23:19:40,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:19:40,343 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:19:40,344 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:19:40,350 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:19:40,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40 WrapperNode [2023-08-31 23:19:40,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:19:40,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:19:40,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:19:40,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:19:40,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,424 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2023-08-31 23:19:40,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:19:40,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:19:40,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:19:40,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:19:40,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:19:40,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:19:40,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:19:40,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:19:40,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (1/1) ... [2023-08-31 23:19:40,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:19:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:19:40,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:19:40,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:19:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:19:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:19:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:19:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:19:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:19:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:19:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:19:40,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:19:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:19:40,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:19:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:19:40,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:19:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:19:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:19:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:19:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:19:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:19:40,575 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:19:40,798 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:19:40,800 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:19:41,163 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:19:41,244 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:19:41,245 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:19:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:19:41 BoogieIcfgContainer [2023-08-31 23:19:41,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:19:41,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:19:41,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:19:41,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:19:41,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:19:39" (1/3) ... [2023-08-31 23:19:41,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d67c0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:19:41, skipping insertion in model container [2023-08-31 23:19:41,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:19:40" (2/3) ... [2023-08-31 23:19:41,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d67c0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:19:41, skipping insertion in model container [2023-08-31 23:19:41,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:19:41" (3/3) ... [2023-08-31 23:19:41,254 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-31 23:19:41,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:19:41,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:19:41,268 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:19:41,330 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:19:41,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:19:41,442 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:19:41,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:41,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:19:41,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:19:41,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-31 23:19:41,463 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:19:41,470 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:19:41,473 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:19:41,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-31 23:19:41,499 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:19:41,499 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:41,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-31 23:19:41,502 INFO L119 LiptonReduction]: Number of co-enabled transitions 3128 [2023-08-31 23:19:48,398 INFO L134 LiptonReduction]: Checked pairs total: 7423 [2023-08-31 23:19:48,398 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:19:48,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:19:48,415 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;@2a038a5c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:19:48,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:19:48,416 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:19:48,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:48,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:48,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:19:48,418 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-31 23:19:48,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 584, now seen corresponding path program 1 times [2023-08-31 23:19:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288724120] [2023-08-31 23:19:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:48,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:48,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:48,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:48,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:19:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:48,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:19:48,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:48,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:48,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288724120] [2023-08-31 23:19:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288724120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:48,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:19:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037814019] [2023-08-31 23:19:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:48,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:19:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:19:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:19:48,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 280 [2023-08-31 23:19:48,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:48,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:48,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 280 [2023-08-31 23:19:48,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:49,412 INFO L130 PetriNetUnfolder]: 4373/6097 cut-off events. [2023-08-31 23:19:49,413 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-31 23:19:49,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12183 conditions, 6097 events. 4373/6097 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 30881 event pairs, 4373 based on Foata normal form. 0/5373 useless extension candidates. Maximal degree in co-relation 12171. Up to 5983 conditions per place. [2023-08-31 23:19:49,455 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-31 23:19:49,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-08-31 23:19:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:19:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:19:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2023-08-31 23:19:49,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339285714285714 [2023-08-31 23:19:49,468 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2023-08-31 23:19:49,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2023-08-31 23:19:49,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:49,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2023-08-31 23:19:49,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:49,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:49,478 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:49,480 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 299 transitions. [2023-08-31 23:19:49,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-08-31 23:19:49,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:19:49,485 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-31 23:19:49,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-31 23:19:49,490 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-31 23:19:49,490 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-31 23:19:49,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:49,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:49,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:49,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:19:49,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:49,700 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-31 23:19:49,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -964475270, now seen corresponding path program 1 times [2023-08-31 23:19:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955821530] [2023-08-31 23:19:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:49,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:49,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:49,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:19:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:49,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:19:49,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:49,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:49,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955821530] [2023-08-31 23:19:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955821530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:49,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:19:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076534438] [2023-08-31 23:19:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:49,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:19:49,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:49,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:19:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:19:49,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 280 [2023-08-31 23:19:49,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:49,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:49,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 280 [2023-08-31 23:19:49,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:50,362 INFO L130 PetriNetUnfolder]: 3632/5248 cut-off events. [2023-08-31 23:19:50,362 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:19:50,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 5248 events. 3632/5248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 28112 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10335. Up to 3973 conditions per place. [2023-08-31 23:19:50,387 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-31 23:19:50,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-08-31 23:19:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:19:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:19:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-31 23:19:50,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-08-31 23:19:50,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-31 23:19:50,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-31 23:19:50,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:50,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-31 23:19:50,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:50,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:50,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:50,396 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 432 transitions. [2023-08-31 23:19:50,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-08-31 23:19:50,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:19:50,398 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-31 23:19:50,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-31 23:19:50,399 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-31 23:19:50,399 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-31 23:19:50,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:50,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:50,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:50,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:19:50,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:50,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:19:50,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 650912999, now seen corresponding path program 1 times [2023-08-31 23:19:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:50,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551514022] [2023-08-31 23:19:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:50,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:50,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:50,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:19:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:50,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:19:50,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:50,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:50,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551514022] [2023-08-31 23:19:50,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551514022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:50,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:50,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:19:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997969600] [2023-08-31 23:19:50,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:19:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:19:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:19:50,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:19:50,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:50,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:50,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:19:50,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:51,232 INFO L130 PetriNetUnfolder]: 2540/3674 cut-off events. [2023-08-31 23:19:51,233 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2023-08-31 23:19:51,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7626 conditions, 3674 events. 2540/3674 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18141 event pairs, 492 based on Foata normal form. 180/3719 useless extension candidates. Maximal degree in co-relation 7622. Up to 2887 conditions per place. [2023-08-31 23:19:51,250 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 36 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-31 23:19:51,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 286 flow [2023-08-31 23:19:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-08-31 23:19:51,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2023-08-31 23:19:51,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-08-31 23:19:51,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-08-31 23:19:51,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:51,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-08-31 23:19:51,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:51,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:51,260 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:51,260 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 696 transitions. [2023-08-31 23:19:51,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 286 flow [2023-08-31 23:19:51,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:19:51,263 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-31 23:19:51,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:19:51,263 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-31 23:19:51,264 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-31 23:19:51,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:51,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:51,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:51,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:19:51,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:51,474 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-31 23:19:51,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1334862761, now seen corresponding path program 1 times [2023-08-31 23:19:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221274504] [2023-08-31 23:19:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:51,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:51,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:51,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:19:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:51,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:19:51,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:51,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:51,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:51,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221274504] [2023-08-31 23:19:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221274504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284112347] [2023-08-31 23:19:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:51,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:51,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:19:51,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:51,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:51,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:19:51,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:52,029 INFO L130 PetriNetUnfolder]: 1284/1990 cut-off events. [2023-08-31 23:19:52,029 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2023-08-31 23:19:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 1990 events. 1284/1990 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9369 event pairs, 186 based on Foata normal form. 132/2063 useless extension candidates. Maximal degree in co-relation 5488. Up to 1027 conditions per place. [2023-08-31 23:19:52,050 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 47 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-31 23:19:52,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 427 flow [2023-08-31 23:19:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:19:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:19:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2023-08-31 23:19:52,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982142857142857 [2023-08-31 23:19:52,054 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 837 transitions. [2023-08-31 23:19:52,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 837 transitions. [2023-08-31 23:19:52,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:52,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 837 transitions. [2023-08-31 23:19:52,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,061 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,061 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 837 transitions. [2023-08-31 23:19:52,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 427 flow [2023-08-31 23:19:52,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:19:52,074 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-31 23:19:52,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-31 23:19:52,075 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-31 23:19:52,076 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-31 23:19:52,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:52,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:52,086 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-31 23:19:52,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:52,286 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-31 23:19:52,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash -195492038, now seen corresponding path program 1 times [2023-08-31 23:19:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752995324] [2023-08-31 23:19:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:52,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:52,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:52,289 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:52,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:19:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:52,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:19:52,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:52,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:52,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:52,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752995324] [2023-08-31 23:19:52,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752995324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:19:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016916502] [2023-08-31 23:19:52,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:52,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:19:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:52,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:19:52,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:19:52,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:19:52,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:52,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:19:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:52,877 INFO L130 PetriNetUnfolder]: 660/1070 cut-off events. [2023-08-31 23:19:52,877 INFO L131 PetriNetUnfolder]: For 1228/1228 co-relation queries the response was YES. [2023-08-31 23:19:52,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1070 events. 660/1070 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4505 event pairs, 124 based on Foata normal form. 56/1111 useless extension candidates. Maximal degree in co-relation 3487. Up to 395 conditions per place. [2023-08-31 23:19:52,884 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 56 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-08-31 23:19:52,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 588 flow [2023-08-31 23:19:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:19:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:19:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 976 transitions. [2023-08-31 23:19:52,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2023-08-31 23:19:52,891 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 976 transitions. [2023-08-31 23:19:52,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 976 transitions. [2023-08-31 23:19:52,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:52,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 976 transitions. [2023-08-31 23:19:52,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.42857142857142) internal successors, (976), 7 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,899 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,899 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 976 transitions. [2023-08-31 23:19:52,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 588 flow [2023-08-31 23:19:52,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 526 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:19:52,913 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-31 23:19:52,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-31 23:19:52,916 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-31 23:19:52,916 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-31 23:19:52,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:52,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:52,920 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] [2023-08-31 23:19:52,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:19:53,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:53,130 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-31 23:19:53,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 108107937, now seen corresponding path program 1 times [2023-08-31 23:19:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713464006] [2023-08-31 23:19:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:53,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:53,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:53,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:53,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:19:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:53,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:19:53,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:53,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:53,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:53,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713464006] [2023-08-31 23:19:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713464006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:19:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917675508] [2023-08-31 23:19:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:53,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:19:53,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:53,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:19:53,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:19:53,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-31 23:19:53,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 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-31 23:19:53,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:53,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-31 23:19:53,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:53,766 INFO L130 PetriNetUnfolder]: 528/839 cut-off events. [2023-08-31 23:19:53,766 INFO L131 PetriNetUnfolder]: For 938/938 co-relation queries the response was YES. [2023-08-31 23:19:53,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 839 events. 528/839 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3359 event pairs, 119 based on Foata normal form. 12/847 useless extension candidates. Maximal degree in co-relation 2629. Up to 340 conditions per place. [2023-08-31 23:19:53,771 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 52 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-31 23:19:53,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 532 flow [2023-08-31 23:19:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:19:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:19:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1091 transitions. [2023-08-31 23:19:53,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870535714285714 [2023-08-31 23:19:53,774 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1091 transitions. [2023-08-31 23:19:53,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1091 transitions. [2023-08-31 23:19:53,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:53,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1091 transitions. [2023-08-31 23:19:53,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.375) internal successors, (1091), 8 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:53,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:53,781 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:53,781 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1091 transitions. [2023-08-31 23:19:53,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 532 flow [2023-08-31 23:19:53,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 470 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:19:53,788 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-31 23:19:53,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-31 23:19:53,789 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-31 23:19:53,789 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-31 23:19:53,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-31 23:19:53,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:53,790 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-31 23:19:53,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:19:54,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:54,000 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-31 23:19:54,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1458885807, now seen corresponding path program 1 times [2023-08-31 23:19:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612976500] [2023-08-31 23:19:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:54,002 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:54,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 (8)] Waiting until timeout for monitored process [2023-08-31 23:19:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:54,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:19:54,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:54,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:54,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:54,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612976500] [2023-08-31 23:19:54,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612976500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940745996] [2023-08-31 23:19:54,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:54,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:54,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:54,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-31 23:19:54,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:54,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:54,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-31 23:19:54,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:54,440 INFO L130 PetriNetUnfolder]: 707/1171 cut-off events. [2023-08-31 23:19:54,440 INFO L131 PetriNetUnfolder]: For 1643/1643 co-relation queries the response was YES. [2023-08-31 23:19:54,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1171 events. 707/1171 cut-off events. For 1643/1643 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5627 event pairs, 115 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 3592. Up to 653 conditions per place. [2023-08-31 23:19:54,446 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 80 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-31 23:19:54,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 657 flow [2023-08-31 23:19:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-31 23:19:54,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49214285714285716 [2023-08-31 23:19:54,449 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-31 23:19:54,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-31 23:19:54,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:54,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-31 23:19:54,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:54,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:54,454 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:54,454 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 5 states and 689 transitions. [2023-08-31 23:19:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 657 flow [2023-08-31 23:19:54,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 516 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:19:54,462 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 173 flow [2023-08-31 23:19:54,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-31 23:19:54,463 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-31 23:19:54,463 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 173 flow [2023-08-31 23:19:54,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:54,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:54,464 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-31 23:19:54,475 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-31 23:19:54,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:54,673 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-31 23:19:54,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -415038275, now seen corresponding path program 2 times [2023-08-31 23:19:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:54,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101328489] [2023-08-31 23:19:54,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:19:54,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:54,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:54,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:54,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:19:54,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:19:54,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:19:54,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:19:54,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:54,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:54,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101328489] [2023-08-31 23:19:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101328489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:54,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509863272] [2023-08-31 23:19:54,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:54,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:54,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:54,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:54,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-31 23:19:54,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:54,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:54,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-31 23:19:54,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:55,166 INFO L130 PetriNetUnfolder]: 1162/1821 cut-off events. [2023-08-31 23:19:55,167 INFO L131 PetriNetUnfolder]: For 1809/1809 co-relation queries the response was YES. [2023-08-31 23:19:55,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 1821 events. 1162/1821 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9119 event pairs, 209 based on Foata normal form. 1/1807 useless extension candidates. Maximal degree in co-relation 5397. Up to 975 conditions per place. [2023-08-31 23:19:55,174 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 79 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2023-08-31 23:19:55,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 545 flow [2023-08-31 23:19:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-31 23:19:55,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4907142857142857 [2023-08-31 23:19:55,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-31 23:19:55,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-31 23:19:55,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:55,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-31 23:19:55,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:55,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:55,181 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:55,181 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 173 flow. Second operand 5 states and 687 transitions. [2023-08-31 23:19:55,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 545 flow [2023-08-31 23:19:55,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:19:55,191 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 207 flow [2023-08-31 23:19:55,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-31 23:19:55,192 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-08-31 23:19:55,192 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 207 flow [2023-08-31 23:19:55,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:55,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:55,193 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-31 23:19:55,203 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 (9)] Ended with exit code 0 [2023-08-31 23:19:55,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:55,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:19:55,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 825675641, now seen corresponding path program 1 times [2023-08-31 23:19:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020358672] [2023-08-31 23:19:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:19:55,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:55,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:55,406 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:55,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:19:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:19:55,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:19:55,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:56,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:56,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020358672] [2023-08-31 23:19:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020358672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:56,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881880856] [2023-08-31 23:19:56,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:56,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:19:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:19:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:19:56,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-31 23:19:56,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:56,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:56,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-31 23:19:56,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:57,085 INFO L130 PetriNetUnfolder]: 938/1541 cut-off events. [2023-08-31 23:19:57,085 INFO L131 PetriNetUnfolder]: For 1856/1856 co-relation queries the response was YES. [2023-08-31 23:19:57,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1541 events. 938/1541 cut-off events. For 1856/1856 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8096 event pairs, 59 based on Foata normal form. 4/1515 useless extension candidates. Maximal degree in co-relation 4727. Up to 1297 conditions per place. [2023-08-31 23:19:57,090 INFO L137 encePairwiseOnDemand]: 275/280 looper letters, 40 selfloop transitions, 4 changer transitions 17/64 dead transitions. [2023-08-31 23:19:57,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 64 transitions, 430 flow [2023-08-31 23:19:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:19:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:19:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-31 23:19:57,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4220238095238095 [2023-08-31 23:19:57,093 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-31 23:19:57,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-31 23:19:57,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:57,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-31 23:19:57,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,114 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 207 flow. Second operand 6 states and 709 transitions. [2023-08-31 23:19:57,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 64 transitions, 430 flow [2023-08-31 23:19:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:19:57,124 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 174 flow [2023-08-31 23:19:57,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-31 23:19:57,125 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-31 23:19:57,125 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 174 flow [2023-08-31 23:19:57,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:57,126 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-31 23:19:57,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:19:57,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:57,337 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-31 23:19:57,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1748426189, now seen corresponding path program 3 times [2023-08-31 23:19:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946447577] [2023-08-31 23:19:57,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:19:57,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:57,339 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:57,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:19:57,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:19:57,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:19:57,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:19:57,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:57,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:57,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946447577] [2023-08-31 23:19:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946447577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:57,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:57,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:19:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523238715] [2023-08-31 23:19:57,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:57,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:19:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:57,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:19:57,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:19:57,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-31 23:19:57,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:57,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-31 23:19:57,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:57,824 INFO L130 PetriNetUnfolder]: 1176/1908 cut-off events. [2023-08-31 23:19:57,825 INFO L131 PetriNetUnfolder]: For 1743/1743 co-relation queries the response was YES. [2023-08-31 23:19:57,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5794 conditions, 1908 events. 1176/1908 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9680 event pairs, 221 based on Foata normal form. 1/1886 useless extension candidates. Maximal degree in co-relation 5780. Up to 1011 conditions per place. [2023-08-31 23:19:57,830 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 40 selfloop transitions, 1 changer transitions 43/86 dead transitions. [2023-08-31 23:19:57,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 564 flow [2023-08-31 23:19:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:19:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:19:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-31 23:19:57,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2023-08-31 23:19:57,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-31 23:19:57,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-31 23:19:57,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:57,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-31 23:19:57,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,838 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,838 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 174 flow. Second operand 5 states and 690 transitions. [2023-08-31 23:19:57,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 564 flow [2023-08-31 23:19:57,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 539 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-31 23:19:57,851 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 168 flow [2023-08-31 23:19:57,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=168, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-31 23:19:57,852 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-31 23:19:57,852 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 168 flow [2023-08-31 23:19:57,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:57,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:57,853 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-31 23:19:57,865 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 (11)] Ended with exit code 0 [2023-08-31 23:19:58,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:58,062 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-31 23:19:58,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash 307085631, now seen corresponding path program 4 times [2023-08-31 23:19:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650462432] [2023-08-31 23:19:58,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:19:58,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:58,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:58,064 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:19:58,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:19:58,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:19:58,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:19:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:19:58,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:19:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:19:58,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:19:58,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:19:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650462432] [2023-08-31 23:19:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650462432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:19:58,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:19:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:19:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27257808] [2023-08-31 23:19:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:19:58,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:19:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:19:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:19:58,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:19:58,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 280 [2023-08-31 23:19:58,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:58,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:19:58,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 280 [2023-08-31 23:19:58,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:19:58,683 INFO L130 PetriNetUnfolder]: 836/1394 cut-off events. [2023-08-31 23:19:58,683 INFO L131 PetriNetUnfolder]: For 1794/1798 co-relation queries the response was YES. [2023-08-31 23:19:58,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4459 conditions, 1394 events. 836/1394 cut-off events. For 1794/1798 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6644 event pairs, 273 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 4446. Up to 498 conditions per place. [2023-08-31 23:19:58,687 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 40 selfloop transitions, 4 changer transitions 38/85 dead transitions. [2023-08-31 23:19:58,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 583 flow [2023-08-31 23:19:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:19:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:19:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1047 transitions. [2023-08-31 23:19:58,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674107142857143 [2023-08-31 23:19:58,691 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1047 transitions. [2023-08-31 23:19:58,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1047 transitions. [2023-08-31 23:19:58,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:19:58,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1047 transitions. [2023-08-31 23:19:58,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:58,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:58,697 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:58,698 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 168 flow. Second operand 8 states and 1047 transitions. [2023-08-31 23:19:58,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 583 flow [2023-08-31 23:19:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 573 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:19:58,705 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 179 flow [2023-08-31 23:19:58,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=8, PETRI_FLOW=179, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-31 23:19:58,706 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-31 23:19:58,706 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 179 flow [2023-08-31 23:19:58,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:19:58,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:19:58,707 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-31 23:19:58,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:19:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:58,917 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-31 23:19:58,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:19:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1809797717, now seen corresponding path program 5 times [2023-08-31 23:19:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:19:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018696788] [2023-08-31 23:19:58,918 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:19:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:19:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:19:58,919 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-31 23:19:58,920 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-31 23:19:59,041 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:19:59,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:19:59,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:19:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:19:59,167 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:19:59,167 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:19:59,168 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:19:59,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:19:59,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:19:59,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:19:59,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:19:59,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:19:59,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:19:59,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:19:59,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:19:59,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:19:59,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:19:59,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:19:59,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:19:59,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:19:59,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:19:59,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:19:59,188 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-31 23:19:59,383 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-31 23:19:59,383 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:19:59,388 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:19:59,388 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:19:59,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:19:59 BasicIcfg [2023-08-31 23:19:59,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:19:59,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:19:59,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:19:59,495 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:19:59,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:19:41" (3/4) ... [2023-08-31 23:19:59,498 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:19:59,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:19:59,499 INFO L158 Benchmark]: Toolchain (without parser) took 19745.10ms. Allocated memory was 79.7MB in the beginning and 490.7MB in the end (delta: 411.0MB). Free memory was 56.2MB in the beginning and 329.4MB in the end (delta: -273.2MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2023-08-31 23:19:59,499 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:19:59,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.51ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 53.6MB in the end (delta: 2.3MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-08-31 23:19:59,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.63ms. Allocated memory is still 79.7MB. Free memory was 53.6MB in the beginning and 51.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:19:59,500 INFO L158 Benchmark]: Boogie Preprocessor took 61.43ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 49.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:19:59,500 INFO L158 Benchmark]: RCFGBuilder took 755.02ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 36.9MB in the end (delta: 12.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-08-31 23:19:59,501 INFO L158 Benchmark]: TraceAbstraction took 18245.86ms. Allocated memory was 79.7MB in the beginning and 490.7MB in the end (delta: 411.0MB). Free memory was 36.1MB in the beginning and 330.4MB in the end (delta: -294.4MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2023-08-31 23:19:59,501 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 490.7MB. Free memory is still 329.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:19:59,502 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.16ms. Allocated memory is still 65.0MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.51ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 53.6MB in the end (delta: 2.3MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.63ms. Allocated memory is still 79.7MB. Free memory was 53.6MB in the beginning and 51.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.43ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 49.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 755.02ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 36.9MB in the end (delta: 12.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18245.86ms. Allocated memory was 79.7MB in the beginning and 490.7MB in the end (delta: 411.0MB). Free memory was 36.1MB in the beginning and 330.4MB in the end (delta: -294.4MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 490.7MB. Free memory is still 329.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 151 PlacesBefore, 50 PlacesAfterwards, 140 TransitionsBefore, 38 TransitionsAfterwards, 3128 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 7423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4376, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1657, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4376, independent: 2553, independent conditional: 0, independent unconditional: 2553, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1657, unknown conditional: 0, unknown unconditional: 1657] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=0, t949={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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=1, t949={11:0}, t950={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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=2, t949={11:0}, t950={15:0}, t951={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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=3, t949={11:0}, t950={15:0}, t951={7:0}, t952={-2147483637: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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={11:0}, t950={15:0}, t951={7:0}, t952={-2147483637:0}, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 863]: 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: 859]: 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: 861]: 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, 179 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: 18.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2156 IncrementalHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 11 mSDtfsCounter, 2156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 195 ConstructedInterpolants, 21 QuantifiedInterpolants, 1760 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1657 ConjunctsInSsa, 78 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-31 23:19:59,521 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