./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:13:58,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:13:58,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:13:59,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:13:59,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:13:59,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:13:59,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:13:59,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:13:59,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:13:59,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:13:59,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:13:59,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:13:59,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:13:59,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:13:59,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:13:59,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:13:59,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:13:59,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:13:59,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:13:59,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:13:59,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:13:59,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:13:59,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:13:59,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:13:59,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:13:59,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:13:59,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:13:59,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:13:59,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:13:59,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:13:59,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:13:59,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:13:59,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:13:59,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:13:59,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:13:59,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:13:59,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:13:59,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:13:59,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:13:59,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:13:59,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:13:59,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:13:59,117 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:13:59,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:13:59,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:13:59,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:13:59,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:13:59,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:13:59,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:13:59,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:13:59,121 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:13:59,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:13:59,122 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:13:59,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:13:59,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:13:59,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:13:59,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:13:59,123 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:13:59,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:13:59,124 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:13:59,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:13:59,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:13:59,124 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:13:59,124 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:13:59,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:13:59,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:13:59,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:13:59,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:13:59,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:13:59,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:13:59,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:13:59,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:13:59,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:13:59,127 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:13:59,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:13:59,127 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:13:59,127 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:13:59,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:13:59,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:13:59,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:13:59,494 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:13:59,495 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:13:59,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-30 03:14:00,580 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:14:00,894 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:14:00,894 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-30 03:14:00,927 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cacdce1ea/3aa744d844ba4b1b8d10745ff2fddb0b/FLAG6bcb16411 [2023-08-30 03:14:00,947 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cacdce1ea/3aa744d844ba4b1b8d10745ff2fddb0b [2023-08-30 03:14:00,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:14:00,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:14:00,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:14:00,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:14:00,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:14:00,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:14:00" (1/1) ... [2023-08-30 03:14:00,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a00a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:00, skipping insertion in model container [2023-08-30 03:14:00,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:14:00" (1/1) ... [2023-08-30 03:14:00,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:14:01,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:14:01,155 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/safe019_power.oepc.i[995,1008] [2023-08-30 03:14:01,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:14:01,413 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:14:01,426 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/safe019_power.oepc.i[995,1008] [2023-08-30 03:14:01,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:14:01,570 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:14:01,571 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:14:01,576 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:14:01,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01 WrapperNode [2023-08-30 03:14:01,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:14:01,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:14:01,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:14:01,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:14:01,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,658 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2023-08-30 03:14:01,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:14:01,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:14:01,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:14:01,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:14:01,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,717 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:14:01,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:14:01,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:14:01,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:14:01,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (1/1) ... [2023-08-30 03:14:01,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:14:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:14:01,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:14:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:14:01,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:14:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:14:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:14:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:14:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:14:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:14:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:14:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:14:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:14:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:14:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:14:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:14:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 03:14:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 03:14:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:14:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:14:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:14:01,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:14:01,803 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:14:01,984 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:14:02,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:14:02,673 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:14:03,423 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:14:03,423 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:14:03,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:14:03 BoogieIcfgContainer [2023-08-30 03:14:03,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:14:03,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:14:03,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:14:03,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:14:03,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:14:00" (1/3) ... [2023-08-30 03:14:03,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6df1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:14:03, skipping insertion in model container [2023-08-30 03:14:03,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:14:01" (2/3) ... [2023-08-30 03:14:03,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f6df1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:14:03, skipping insertion in model container [2023-08-30 03:14:03,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:14:03" (3/3) ... [2023-08-30 03:14:03,437 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-08-30 03:14:03,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:14:03,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-08-30 03:14:03,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:14:03,607 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:14:03,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 201 transitions, 422 flow [2023-08-30 03:14:03,715 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2023-08-30 03:14:03,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:03,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 320 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-30 03:14:03,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 201 transitions, 422 flow [2023-08-30 03:14:03,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 197 transitions, 406 flow [2023-08-30 03:14:03,740 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:14:03,758 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 197 transitions, 406 flow [2023-08-30 03:14:03,762 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 197 transitions, 406 flow [2023-08-30 03:14:03,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 197 transitions, 406 flow [2023-08-30 03:14:03,852 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2023-08-30 03:14:03,852 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 327 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-30 03:14:03,860 INFO L119 LiptonReduction]: Number of co-enabled transitions 8892 [2023-08-30 03:14:18,753 INFO L134 LiptonReduction]: Checked pairs total: 42261 [2023-08-30 03:14:18,753 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-30 03:14:18,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:14:18,771 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;@352b104b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:14:18,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2023-08-30 03:14:18,772 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:14:18,773 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:18,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:18,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:14:18,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:18,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1237, now seen corresponding path program 1 times [2023-08-30 03:14:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:18,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379546518] [2023-08-30 03:14:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:18,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379546518] [2023-08-30 03:14:18,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379546518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:18,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:14:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142374446] [2023-08-30 03:14:18,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:18,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:14:18,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:18,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:14:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:14:18,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 359 [2023-08-30 03:14:18,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:18,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:18,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 359 [2023-08-30 03:14:18,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:30,851 INFO L130 PetriNetUnfolder]: 65830/87887 cut-off events. [2023-08-30 03:14:30,851 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 03:14:31,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174811 conditions, 87887 events. 65830/87887 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6089. Compared 592145 event pairs, 65830 based on Foata normal form. 0/44894 useless extension candidates. Maximal degree in co-relation 174799. Up to 86637 conditions per place. [2023-08-30 03:14:31,430 INFO L137 encePairwiseOnDemand]: 326/359 looper letters, 48 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2023-08-30 03:14:31,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 216 flow [2023-08-30 03:14:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:14:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:14:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 375 transitions. [2023-08-30 03:14:31,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222841225626741 [2023-08-30 03:14:31,452 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 375 transitions. [2023-08-30 03:14:31,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 375 transitions. [2023-08-30 03:14:31,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:31,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 375 transitions. [2023-08-30 03:14:31,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:31,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 359.0) internal successors, (1077), 3 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:31,471 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 359.0) internal successors, (1077), 3 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:31,473 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 188 flow. Second operand 2 states and 375 transitions. [2023-08-30 03:14:31,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 216 flow [2023-08-30 03:14:31,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:14:31,490 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 116 flow [2023-08-30 03:14:31,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-08-30 03:14:31,496 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-08-30 03:14:31,496 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 116 flow [2023-08-30 03:14:31,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:31,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:31,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:14:31,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:14:31,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:31,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1224243, now seen corresponding path program 1 times [2023-08-30 03:14:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795418302] [2023-08-30 03:14:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:31,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:31,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795418302] [2023-08-30 03:14:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795418302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:31,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:14:31,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256714828] [2023-08-30 03:14:31,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:31,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:14:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:14:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:14:31,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 359 [2023-08-30 03:14:31,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:31,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:31,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 359 [2023-08-30 03:14:31,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:36,136 INFO L130 PetriNetUnfolder]: 21950/29792 cut-off events. [2023-08-30 03:14:36,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:36,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59232 conditions, 29792 events. 21950/29792 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 180178 event pairs, 21950 based on Foata normal form. 1212/20172 useless extension candidates. Maximal degree in co-relation 59229. Up to 29259 conditions per place. [2023-08-30 03:14:36,301 INFO L137 encePairwiseOnDemand]: 348/359 looper letters, 38 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-30 03:14:36,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 174 flow [2023-08-30 03:14:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:14:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:14:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-08-30 03:14:36,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44661095636026 [2023-08-30 03:14:36,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-08-30 03:14:36,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-08-30 03:14:36,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:36,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-08-30 03:14:36,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:36,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:36,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:36,312 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 116 flow. Second operand 3 states and 481 transitions. [2023-08-30 03:14:36,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 174 flow [2023-08-30 03:14:36,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:14:36,313 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2023-08-30 03:14:36,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-30 03:14:36,314 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2023-08-30 03:14:36,315 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2023-08-30 03:14:36,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:36,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:36,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:14:36,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:14:36,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:36,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1224242, now seen corresponding path program 1 times [2023-08-30 03:14:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:36,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021368505] [2023-08-30 03:14:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021368505] [2023-08-30 03:14:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021368505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:14:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960135248] [2023-08-30 03:14:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:36,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:14:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:14:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:14:36,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 359 [2023-08-30 03:14:36,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:36,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:36,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 359 [2023-08-30 03:14:36,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:39,711 INFO L130 PetriNetUnfolder]: 19258/27105 cut-off events. [2023-08-30 03:14:39,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:14:39,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54027 conditions, 27105 events. 19258/27105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 167287 event pairs, 10580 based on Foata normal form. 0/21797 useless extension candidates. Maximal degree in co-relation 54023. Up to 13785 conditions per place. [2023-08-30 03:14:39,842 INFO L137 encePairwiseOnDemand]: 338/359 looper letters, 43 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-30 03:14:39,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 230 flow [2023-08-30 03:14:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:14:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:14:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2023-08-30 03:14:39,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438254410399257 [2023-08-30 03:14:39,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2023-08-30 03:14:39,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2023-08-30 03:14:39,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:39,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2023-08-30 03:14:39,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:39,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:39,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:39,849 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 3 states and 478 transitions. [2023-08-30 03:14:39,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 230 flow [2023-08-30 03:14:39,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:14:39,851 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 185 flow [2023-08-30 03:14:39,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-08-30 03:14:39,852 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2023-08-30 03:14:39,852 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 185 flow [2023-08-30 03:14:39,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:39,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:39,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:39,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:14:39,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:39,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -104464561, now seen corresponding path program 1 times [2023-08-30 03:14:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557190740] [2023-08-30 03:14:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557190740] [2023-08-30 03:14:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557190740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:14:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299307368] [2023-08-30 03:14:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:39,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:14:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:14:39,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:14:39,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 359 [2023-08-30 03:14:39,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:39,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:39,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 359 [2023-08-30 03:14:39,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:43,186 INFO L130 PetriNetUnfolder]: 17613/26090 cut-off events. [2023-08-30 03:14:43,186 INFO L131 PetriNetUnfolder]: For 7520/7685 co-relation queries the response was YES. [2023-08-30 03:14:43,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68398 conditions, 26090 events. 17613/26090 cut-off events. For 7520/7685 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 179637 event pairs, 7109 based on Foata normal form. 0/23377 useless extension candidates. Maximal degree in co-relation 68393. Up to 14360 conditions per place. [2023-08-30 03:14:43,330 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 75 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-30 03:14:43,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 467 flow [2023-08-30 03:14:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:14:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:14:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2023-08-30 03:14:43,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688950789229341 [2023-08-30 03:14:43,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2023-08-30 03:14:43,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2023-08-30 03:14:43,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:43,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2023-08-30 03:14:43,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:43,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:43,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:43,337 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 185 flow. Second operand 3 states and 505 transitions. [2023-08-30 03:14:43,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 467 flow [2023-08-30 03:14:43,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:43,403 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 176 flow [2023-08-30 03:14:43,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-30 03:14:43,404 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2023-08-30 03:14:43,404 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 176 flow [2023-08-30 03:14:43,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:43,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:43,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:43,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:14:43,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:43,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash -104464329, now seen corresponding path program 1 times [2023-08-30 03:14:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:43,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682840195] [2023-08-30 03:14:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:43,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:43,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682840195] [2023-08-30 03:14:43,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682840195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:43,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:43,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:14:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692011594] [2023-08-30 03:14:43,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:43,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:14:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:14:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:14:43,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 359 [2023-08-30 03:14:43,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:43,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:43,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 359 [2023-08-30 03:14:43,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:46,804 INFO L130 PetriNetUnfolder]: 16861/24457 cut-off events. [2023-08-30 03:14:46,804 INFO L131 PetriNetUnfolder]: For 5980/6016 co-relation queries the response was YES. [2023-08-30 03:14:46,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64646 conditions, 24457 events. 16861/24457 cut-off events. For 5980/6016 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 163475 event pairs, 3821 based on Foata normal form. 0/20262 useless extension candidates. Maximal degree in co-relation 64640. Up to 19377 conditions per place. [2023-08-30 03:14:46,937 INFO L137 encePairwiseOnDemand]: 356/359 looper letters, 70 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-30 03:14:46,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 424 flow [2023-08-30 03:14:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:14:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:14:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-30 03:14:46,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596100278551532 [2023-08-30 03:14:46,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-30 03:14:46,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-30 03:14:46,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:46,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-30 03:14:46,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:46,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:46,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:46,944 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 176 flow. Second operand 3 states and 495 transitions. [2023-08-30 03:14:46,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 424 flow [2023-08-30 03:14:46,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:46,946 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 178 flow [2023-08-30 03:14:46,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-30 03:14:46,947 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2023-08-30 03:14:46,948 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 178 flow [2023-08-30 03:14:46,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:46,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:46,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:46,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:14:46,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:46,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash -964627495, now seen corresponding path program 1 times [2023-08-30 03:14:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922649687] [2023-08-30 03:14:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922649687] [2023-08-30 03:14:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922649687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:47,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:47,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:14:47,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002059553] [2023-08-30 03:14:47,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:47,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:14:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:14:47,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:14:47,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 359 [2023-08-30 03:14:47,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:47,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:47,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 359 [2023-08-30 03:14:47,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:49,942 INFO L130 PetriNetUnfolder]: 17791/25368 cut-off events. [2023-08-30 03:14:49,942 INFO L131 PetriNetUnfolder]: For 3829/3982 co-relation queries the response was YES. [2023-08-30 03:14:50,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67910 conditions, 25368 events. 17791/25368 cut-off events. For 3829/3982 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 161130 event pairs, 9811 based on Foata normal form. 0/20399 useless extension candidates. Maximal degree in co-relation 67903. Up to 14718 conditions per place. [2023-08-30 03:14:50,115 INFO L137 encePairwiseOnDemand]: 357/359 looper letters, 79 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-30 03:14:50,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 461 flow [2023-08-30 03:14:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:14:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:14:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2023-08-30 03:14:50,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438254410399257 [2023-08-30 03:14:50,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2023-08-30 03:14:50,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2023-08-30 03:14:50,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:50,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2023-08-30 03:14:50,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:50,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:50,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:50,122 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 178 flow. Second operand 3 states and 478 transitions. [2023-08-30 03:14:50,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 461 flow [2023-08-30 03:14:50,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:50,126 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 174 flow [2023-08-30 03:14:50,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-30 03:14:50,127 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2023-08-30 03:14:50,127 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 174 flow [2023-08-30 03:14:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:50,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:50,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:14:50,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:50,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 892324558, now seen corresponding path program 1 times [2023-08-30 03:14:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844028961] [2023-08-30 03:14:50,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844028961] [2023-08-30 03:14:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844028961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:50,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:50,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:14:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712695261] [2023-08-30 03:14:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:50,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:14:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:14:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:14:50,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 359 [2023-08-30 03:14:50,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:50,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:50,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 359 [2023-08-30 03:14:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:53,221 INFO L130 PetriNetUnfolder]: 16894/25095 cut-off events. [2023-08-30 03:14:53,221 INFO L131 PetriNetUnfolder]: For 5305/5446 co-relation queries the response was YES. [2023-08-30 03:14:53,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65815 conditions, 25095 events. 16894/25095 cut-off events. For 5305/5446 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 172632 event pairs, 6960 based on Foata normal form. 111/21107 useless extension candidates. Maximal degree in co-relation 65808. Up to 13417 conditions per place. [2023-08-30 03:14:53,455 INFO L137 encePairwiseOnDemand]: 356/359 looper letters, 73 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-30 03:14:53,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 437 flow [2023-08-30 03:14:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:14:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:14:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2023-08-30 03:14:53,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4373259052924791 [2023-08-30 03:14:53,458 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 628 transitions. [2023-08-30 03:14:53,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 628 transitions. [2023-08-30 03:14:53,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:53,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 628 transitions. [2023-08-30 03:14:53,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:53,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:53,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:53,463 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 174 flow. Second operand 4 states and 628 transitions. [2023-08-30 03:14:53,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 437 flow [2023-08-30 03:14:53,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:53,469 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 171 flow [2023-08-30 03:14:53,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-30 03:14:53,470 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2023-08-30 03:14:53,470 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 171 flow [2023-08-30 03:14:53,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:53,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:53,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:53,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:14:53,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:53,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -789547870, now seen corresponding path program 1 times [2023-08-30 03:14:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777845576] [2023-08-30 03:14:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777845576] [2023-08-30 03:14:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777845576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:14:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23437440] [2023-08-30 03:14:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:14:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:53,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:14:53,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:14:53,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 359 [2023-08-30 03:14:53,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:53,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:53,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 359 [2023-08-30 03:14:53,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:14:57,970 INFO L130 PetriNetUnfolder]: 25043/36172 cut-off events. [2023-08-30 03:14:57,971 INFO L131 PetriNetUnfolder]: For 13298/13740 co-relation queries the response was YES. [2023-08-30 03:14:58,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98550 conditions, 36172 events. 25043/36172 cut-off events. For 13298/13740 co-relation queries the response was YES. Maximal size of possible extension queue 2348. Compared 263808 event pairs, 4626 based on Foata normal form. 233/29722 useless extension candidates. Maximal degree in co-relation 98544. Up to 16028 conditions per place. [2023-08-30 03:14:58,283 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 102 selfloop transitions, 3 changer transitions 0/112 dead transitions. [2023-08-30 03:14:58,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 612 flow [2023-08-30 03:14:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:14:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:14:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2023-08-30 03:14:58,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4582172701949861 [2023-08-30 03:14:58,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2023-08-30 03:14:58,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2023-08-30 03:14:58,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:14:58,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2023-08-30 03:14:58,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,289 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,289 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 171 flow. Second operand 4 states and 658 transitions. [2023-08-30 03:14:58,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 612 flow [2023-08-30 03:14:58,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 112 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:14:58,294 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 186 flow [2023-08-30 03:14:58,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-30 03:14:58,294 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2023-08-30 03:14:58,295 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 186 flow [2023-08-30 03:14:58,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:14:58,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:14:58,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:14:58,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:14:58,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:14:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1605997030, now seen corresponding path program 1 times [2023-08-30 03:14:58,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:14:58,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695484181] [2023-08-30 03:14:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:14:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:14:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:14:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:14:58,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:14:58,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695484181] [2023-08-30 03:14:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695484181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:14:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:14:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:14:58,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254262255] [2023-08-30 03:14:58,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:14:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:14:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:14:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:14:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:14:58,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 359 [2023-08-30 03:14:58,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:14:58,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:14:58,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 359 [2023-08-30 03:14:58,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:03,587 INFO L130 PetriNetUnfolder]: 25590/37510 cut-off events. [2023-08-30 03:15:03,587 INFO L131 PetriNetUnfolder]: For 11528/11780 co-relation queries the response was YES. [2023-08-30 03:15:03,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105628 conditions, 37510 events. 25590/37510 cut-off events. For 11528/11780 co-relation queries the response was YES. Maximal size of possible extension queue 2367. Compared 268552 event pairs, 10007 based on Foata normal form. 30/29588 useless extension candidates. Maximal degree in co-relation 105620. Up to 20403 conditions per place. [2023-08-30 03:15:03,895 INFO L137 encePairwiseOnDemand]: 354/359 looper letters, 89 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2023-08-30 03:15:03,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 104 transitions, 586 flow [2023-08-30 03:15:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2023-08-30 03:15:03,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4415041782729805 [2023-08-30 03:15:03,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 634 transitions. [2023-08-30 03:15:03,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions. [2023-08-30 03:15:03,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:03,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions. [2023-08-30 03:15:03,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,902 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,902 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 186 flow. Second operand 4 states and 634 transitions. [2023-08-30 03:15:03,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 104 transitions, 586 flow [2023-08-30 03:15:03,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:03,914 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 239 flow [2023-08-30 03:15:03,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=182, 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=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-08-30 03:15:03,915 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2023-08-30 03:15:03,915 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 239 flow [2023-08-30 03:15:03,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:03,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:03,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:15:03,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:03,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1605979129, now seen corresponding path program 1 times [2023-08-30 03:15:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30739117] [2023-08-30 03:15:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:04,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30739117] [2023-08-30 03:15:04,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30739117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:04,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:04,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:15:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297774795] [2023-08-30 03:15:04,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:04,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:15:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:15:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:15:04,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 359 [2023-08-30 03:15:04,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:04,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:04,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 359 [2023-08-30 03:15:04,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:08,676 INFO L130 PetriNetUnfolder]: 23694/33798 cut-off events. [2023-08-30 03:15:08,677 INFO L131 PetriNetUnfolder]: For 12539/12539 co-relation queries the response was YES. [2023-08-30 03:15:08,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105337 conditions, 33798 events. 23694/33798 cut-off events. For 12539/12539 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 222305 event pairs, 7219 based on Foata normal form. 92/28438 useless extension candidates. Maximal degree in co-relation 105327. Up to 16089 conditions per place. [2023-08-30 03:15:08,894 INFO L137 encePairwiseOnDemand]: 341/359 looper letters, 63 selfloop transitions, 14 changer transitions 0/79 dead transitions. [2023-08-30 03:15:08,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 498 flow [2023-08-30 03:15:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-08-30 03:15:08,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213091922005571 [2023-08-30 03:15:08,896 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-08-30 03:15:08,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-08-30 03:15:08,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:08,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-08-30 03:15:08,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:08,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:08,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:08,900 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 239 flow. Second operand 4 states and 605 transitions. [2023-08-30 03:15:08,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 498 flow [2023-08-30 03:15:08,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:08,961 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 336 flow [2023-08-30 03:15:08,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-30 03:15:08,962 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -33 predicate places. [2023-08-30 03:15:08,962 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 336 flow [2023-08-30 03:15:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:08,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:08,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:08,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:15:08,963 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:08,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash -745199287, now seen corresponding path program 1 times [2023-08-30 03:15:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698578551] [2023-08-30 03:15:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698578551] [2023-08-30 03:15:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698578551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 03:15:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647348947] [2023-08-30 03:15:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:10,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 03:15:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:10,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 03:15:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-08-30 03:15:11,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 359 [2023-08-30 03:15:11,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 336 flow. Second operand has 11 states, 11 states have (on average 123.54545454545455) internal successors, (1359), 11 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:11,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:11,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 359 [2023-08-30 03:15:11,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:16,106 INFO L130 PetriNetUnfolder]: 24660/35129 cut-off events. [2023-08-30 03:15:16,106 INFO L131 PetriNetUnfolder]: For 31478/31478 co-relation queries the response was YES. [2023-08-30 03:15:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126180 conditions, 35129 events. 24660/35129 cut-off events. For 31478/31478 co-relation queries the response was YES. Maximal size of possible extension queue 2132. Compared 233480 event pairs, 6028 based on Foata normal form. 30/31994 useless extension candidates. Maximal degree in co-relation 126169. Up to 31989 conditions per place. [2023-08-30 03:15:16,345 INFO L137 encePairwiseOnDemand]: 346/359 looper letters, 125 selfloop transitions, 40 changer transitions 0/166 dead transitions. [2023-08-30 03:15:16,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 166 transitions, 1217 flow [2023-08-30 03:15:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 03:15:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 03:15:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1594 transitions. [2023-08-30 03:15:16,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3700092850510678 [2023-08-30 03:15:16,350 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1594 transitions. [2023-08-30 03:15:16,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1594 transitions. [2023-08-30 03:15:16,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:16,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1594 transitions. [2023-08-30 03:15:16,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 132.83333333333334) internal successors, (1594), 12 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:16,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 359.0) internal successors, (4667), 13 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:16,361 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 359.0) internal successors, (4667), 13 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:16,362 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 336 flow. Second operand 12 states and 1594 transitions. [2023-08-30 03:15:16,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 166 transitions, 1217 flow [2023-08-30 03:15:16,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 166 transitions, 1213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:16,503 INFO L231 Difference]: Finished difference. Result has 83 places, 95 transitions, 720 flow [2023-08-30 03:15:16,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=720, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2023-08-30 03:15:16,504 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -17 predicate places. [2023-08-30 03:15:16,504 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 720 flow [2023-08-30 03:15:16,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.54545454545455) internal successors, (1359), 11 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:16,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:16,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:16,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:15:16,506 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:16,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1754250358, now seen corresponding path program 1 times [2023-08-30 03:15:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131035402] [2023-08-30 03:15:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131035402] [2023-08-30 03:15:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131035402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:16,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:15:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826137408] [2023-08-30 03:15:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:15:16,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:15:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:15:16,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 359 [2023-08-30 03:15:16,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 720 flow. Second operand has 7 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:16,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:16,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 359 [2023-08-30 03:15:16,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:21,267 INFO L130 PetriNetUnfolder]: 20957/29907 cut-off events. [2023-08-30 03:15:21,267 INFO L131 PetriNetUnfolder]: For 33659/33659 co-relation queries the response was YES. [2023-08-30 03:15:21,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112838 conditions, 29907 events. 20957/29907 cut-off events. For 33659/33659 co-relation queries the response was YES. Maximal size of possible extension queue 1812. Compared 193354 event pairs, 5089 based on Foata normal form. 376/27408 useless extension candidates. Maximal degree in co-relation 112820. Up to 12433 conditions per place. [2023-08-30 03:15:21,496 INFO L137 encePairwiseOnDemand]: 341/359 looper letters, 102 selfloop transitions, 27 changer transitions 0/131 dead transitions. [2023-08-30 03:15:21,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 1143 flow [2023-08-30 03:15:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:15:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:15:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2023-08-30 03:15:21,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025069637883008 [2023-08-30 03:15:21,499 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 867 transitions. [2023-08-30 03:15:21,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 867 transitions. [2023-08-30 03:15:21,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:21,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 867 transitions. [2023-08-30 03:15:21,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:21,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 359.0) internal successors, (2513), 7 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:21,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 359.0) internal successors, (2513), 7 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:21,504 INFO L175 Difference]: Start difference. First operand has 83 places, 95 transitions, 720 flow. Second operand 6 states and 867 transitions. [2023-08-30 03:15:21,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 1143 flow [2023-08-30 03:15:21,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 1128 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 03:15:21,929 INFO L231 Difference]: Finished difference. Result has 89 places, 99 transitions, 851 flow [2023-08-30 03:15:21,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=89, PETRI_TRANSITIONS=99} [2023-08-30 03:15:21,930 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -11 predicate places. [2023-08-30 03:15:21,930 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 99 transitions, 851 flow [2023-08-30 03:15:21,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:21,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:21,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:21,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:15:21,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:21,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 373235621, now seen corresponding path program 1 times [2023-08-30 03:15:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472385104] [2023-08-30 03:15:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:22,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-30 03:15:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472385104] [2023-08-30 03:15:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472385104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992185347] [2023-08-30 03:15:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:22,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:15:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:22,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:15:22,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:15:22,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 359 [2023-08-30 03:15:22,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 99 transitions, 851 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:22,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:22,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 359 [2023-08-30 03:15:22,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:28,660 INFO L130 PetriNetUnfolder]: 25784/37100 cut-off events. [2023-08-30 03:15:28,660 INFO L131 PetriNetUnfolder]: For 70696/70704 co-relation queries the response was YES. [2023-08-30 03:15:28,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156410 conditions, 37100 events. 25784/37100 cut-off events. For 70696/70704 co-relation queries the response was YES. Maximal size of possible extension queue 2388. Compared 253884 event pairs, 13708 based on Foata normal form. 24/33131 useless extension candidates. Maximal degree in co-relation 156390. Up to 28592 conditions per place. [2023-08-30 03:15:29,023 INFO L137 encePairwiseOnDemand]: 351/359 looper letters, 102 selfloop transitions, 35 changer transitions 0/141 dead transitions. [2023-08-30 03:15:29,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 141 transitions, 1465 flow [2023-08-30 03:15:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2023-08-30 03:15:29,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296657381615599 [2023-08-30 03:15:29,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 617 transitions. [2023-08-30 03:15:29,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 617 transitions. [2023-08-30 03:15:29,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:29,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 617 transitions. [2023-08-30 03:15:29,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:29,028 INFO L175 Difference]: Start difference. First operand has 89 places, 99 transitions, 851 flow. Second operand 4 states and 617 transitions. [2023-08-30 03:15:29,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 141 transitions, 1465 flow [2023-08-30 03:15:30,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 141 transitions, 1433 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:30,142 INFO L231 Difference]: Finished difference. Result has 90 places, 117 transitions, 1133 flow [2023-08-30 03:15:30,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1133, PETRI_PLACES=90, PETRI_TRANSITIONS=117} [2023-08-30 03:15:30,143 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -10 predicate places. [2023-08-30 03:15:30,143 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 117 transitions, 1133 flow [2023-08-30 03:15:30,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:30,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:30,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:30,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:15:30,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:30,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1253093708, now seen corresponding path program 1 times [2023-08-30 03:15:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:30,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773439764] [2023-08-30 03:15:30,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773439764] [2023-08-30 03:15:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773439764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:15:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365702412] [2023-08-30 03:15:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:30,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:15:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:30,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:15:30,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:15:30,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 359 [2023-08-30 03:15:30,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 117 transitions, 1133 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:30,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:30,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 359 [2023-08-30 03:15:30,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:33,907 INFO L130 PetriNetUnfolder]: 13861/21059 cut-off events. [2023-08-30 03:15:33,907 INFO L131 PetriNetUnfolder]: For 54211/54884 co-relation queries the response was YES. [2023-08-30 03:15:33,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96376 conditions, 21059 events. 13861/21059 cut-off events. For 54211/54884 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 147444 event pairs, 4496 based on Foata normal form. 281/18847 useless extension candidates. Maximal degree in co-relation 96354. Up to 19115 conditions per place. [2023-08-30 03:15:34,065 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 118 selfloop transitions, 5 changer transitions 0/144 dead transitions. [2023-08-30 03:15:34,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 1530 flow [2023-08-30 03:15:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:15:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:15:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-30 03:15:34,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447539461467038 [2023-08-30 03:15:34,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-30 03:15:34,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-30 03:15:34,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:34,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-30 03:15:34,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,071 INFO L175 Difference]: Start difference. First operand has 90 places, 117 transitions, 1133 flow. Second operand 3 states and 479 transitions. [2023-08-30 03:15:34,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 1530 flow [2023-08-30 03:15:34,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 144 transitions, 1483 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:34,260 INFO L231 Difference]: Finished difference. Result has 91 places, 121 transitions, 1126 flow [2023-08-30 03:15:34,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=91, PETRI_TRANSITIONS=121} [2023-08-30 03:15:34,261 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -9 predicate places. [2023-08-30 03:15:34,261 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 121 transitions, 1126 flow [2023-08-30 03:15:34,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:34,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:34,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:15:34,261 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:34,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash -314889308, now seen corresponding path program 1 times [2023-08-30 03:15:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:34,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631811951] [2023-08-30 03:15:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:34,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631811951] [2023-08-30 03:15:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631811951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:34,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:15:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865091786] [2023-08-30 03:15:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:34,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:15:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:34,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:15:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:15:34,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 359 [2023-08-30 03:15:34,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 121 transitions, 1126 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:34,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:34,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 359 [2023-08-30 03:15:34,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:35,835 INFO L130 PetriNetUnfolder]: 4030/6715 cut-off events. [2023-08-30 03:15:35,836 INFO L131 PetriNetUnfolder]: For 16245/16591 co-relation queries the response was YES. [2023-08-30 03:15:35,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30726 conditions, 6715 events. 4030/6715 cut-off events. For 16245/16591 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 44053 event pairs, 937 based on Foata normal form. 237/6253 useless extension candidates. Maximal degree in co-relation 30703. Up to 5164 conditions per place. [2023-08-30 03:15:35,874 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 122 selfloop transitions, 9 changer transitions 0/146 dead transitions. [2023-08-30 03:15:35,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 1419 flow [2023-08-30 03:15:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2023-08-30 03:15:35,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4428969359331476 [2023-08-30 03:15:35,876 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2023-08-30 03:15:35,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2023-08-30 03:15:35,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:35,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2023-08-30 03:15:35,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,883 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,883 INFO L175 Difference]: Start difference. First operand has 91 places, 121 transitions, 1126 flow. Second operand 4 states and 636 transitions. [2023-08-30 03:15:35,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 1419 flow [2023-08-30 03:15:35,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 1377 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-30 03:15:35,932 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 907 flow [2023-08-30 03:15:35,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=907, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2023-08-30 03:15:35,933 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -13 predicate places. [2023-08-30 03:15:35,933 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 907 flow [2023-08-30 03:15:35,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:35,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:35,933 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-30 03:15:35,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:15:35,933 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:35,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -617284327, now seen corresponding path program 1 times [2023-08-30 03:15:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179769041] [2023-08-30 03:15:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:36,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179769041] [2023-08-30 03:15:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179769041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:36,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:36,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:15:36,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876202177] [2023-08-30 03:15:36,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:36,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:15:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:36,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:15:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:15:36,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 359 [2023-08-30 03:15:36,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 907 flow. Second operand has 8 states, 8 states have (on average 136.5) internal successors, (1092), 8 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:36,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:36,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 359 [2023-08-30 03:15:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:38,556 INFO L130 PetriNetUnfolder]: 7455/11995 cut-off events. [2023-08-30 03:15:38,556 INFO L131 PetriNetUnfolder]: For 31190/31190 co-relation queries the response was YES. [2023-08-30 03:15:38,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55537 conditions, 11995 events. 7455/11995 cut-off events. For 31190/31190 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 78321 event pairs, 1311 based on Foata normal form. 30/11366 useless extension candidates. Maximal degree in co-relation 55516. Up to 4291 conditions per place. [2023-08-30 03:15:38,635 INFO L137 encePairwiseOnDemand]: 343/359 looper letters, 161 selfloop transitions, 101 changer transitions 0/263 dead transitions. [2023-08-30 03:15:38,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 263 transitions, 2727 flow [2023-08-30 03:15:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:15:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:15:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1212 transitions. [2023-08-30 03:15:38,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4220055710306407 [2023-08-30 03:15:38,639 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1212 transitions. [2023-08-30 03:15:38,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1212 transitions. [2023-08-30 03:15:38,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:38,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1212 transitions. [2023-08-30 03:15:38,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.5) internal successors, (1212), 8 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:38,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 359.0) internal successors, (3231), 9 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:38,646 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 359.0) internal successors, (3231), 9 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:38,646 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 907 flow. Second operand 8 states and 1212 transitions. [2023-08-30 03:15:38,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 263 transitions, 2727 flow [2023-08-30 03:15:38,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 263 transitions, 2673 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:38,748 INFO L231 Difference]: Finished difference. Result has 92 places, 161 transitions, 1854 flow [2023-08-30 03:15:38,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1854, PETRI_PLACES=92, PETRI_TRANSITIONS=161} [2023-08-30 03:15:38,749 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -8 predicate places. [2023-08-30 03:15:38,749 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 161 transitions, 1854 flow [2023-08-30 03:15:38,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 136.5) internal successors, (1092), 8 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:38,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:38,750 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-30 03:15:38,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:15:38,750 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:38,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1877906743, now seen corresponding path program 2 times [2023-08-30 03:15:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549257544] [2023-08-30 03:15:38,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549257544] [2023-08-30 03:15:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549257544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:39,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:15:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689945972] [2023-08-30 03:15:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:39,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:15:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:39,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:15:39,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:15:39,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 359 [2023-08-30 03:15:39,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 161 transitions, 1854 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:39,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:39,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 359 [2023-08-30 03:15:39,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:39,844 INFO L130 PetriNetUnfolder]: 1956/3337 cut-off events. [2023-08-30 03:15:39,844 INFO L131 PetriNetUnfolder]: For 9026/9395 co-relation queries the response was YES. [2023-08-30 03:15:39,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14688 conditions, 3337 events. 1956/3337 cut-off events. For 9026/9395 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19477 event pairs, 247 based on Foata normal form. 296/3477 useless extension candidates. Maximal degree in co-relation 14665. Up to 1076 conditions per place. [2023-08-30 03:15:39,859 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 129 selfloop transitions, 13 changer transitions 0/159 dead transitions. [2023-08-30 03:15:39,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 159 transitions, 1659 flow [2023-08-30 03:15:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:15:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:15:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 789 transitions. [2023-08-30 03:15:39,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4395543175487465 [2023-08-30 03:15:39,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 789 transitions. [2023-08-30 03:15:39,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 789 transitions. [2023-08-30 03:15:39,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:39,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 789 transitions. [2023-08-30 03:15:39,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:39,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 359.0) internal successors, (2154), 6 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:39,866 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 359.0) internal successors, (2154), 6 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:39,866 INFO L175 Difference]: Start difference. First operand has 92 places, 161 transitions, 1854 flow. Second operand 5 states and 789 transitions. [2023-08-30 03:15:39,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 159 transitions, 1659 flow [2023-08-30 03:15:39,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 159 transitions, 1615 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-30 03:15:39,889 INFO L231 Difference]: Finished difference. Result has 92 places, 108 transitions, 1078 flow [2023-08-30 03:15:39,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1078, PETRI_PLACES=92, PETRI_TRANSITIONS=108} [2023-08-30 03:15:39,890 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -8 predicate places. [2023-08-30 03:15:39,890 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 108 transitions, 1078 flow [2023-08-30 03:15:39,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:39,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:39,891 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-30 03:15:39,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:15:39,891 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:39,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1360533755, now seen corresponding path program 1 times [2023-08-30 03:15:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:39,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490935622] [2023-08-30 03:15:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490935622] [2023-08-30 03:15:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490935622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:15:41,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002796415] [2023-08-30 03:15:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:41,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:15:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:15:41,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:15:41,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 359 [2023-08-30 03:15:41,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 108 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:41,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:41,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 359 [2023-08-30 03:15:41,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:42,495 INFO L130 PetriNetUnfolder]: 2916/5137 cut-off events. [2023-08-30 03:15:42,495 INFO L131 PetriNetUnfolder]: For 17839/17857 co-relation queries the response was YES. [2023-08-30 03:15:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24532 conditions, 5137 events. 2916/5137 cut-off events. For 17839/17857 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 32699 event pairs, 780 based on Foata normal form. 12/4941 useless extension candidates. Maximal degree in co-relation 24509. Up to 2734 conditions per place. [2023-08-30 03:15:42,546 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 138 selfloop transitions, 28 changer transitions 0/173 dead transitions. [2023-08-30 03:15:42,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 173 transitions, 2103 flow [2023-08-30 03:15:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:15:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:15:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2023-08-30 03:15:42,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275766016713092 [2023-08-30 03:15:42,549 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2023-08-30 03:15:42,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2023-08-30 03:15:42,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:42,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2023-08-30 03:15:42,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,552 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,552 INFO L175 Difference]: Start difference. First operand has 92 places, 108 transitions, 1078 flow. Second operand 4 states and 614 transitions. [2023-08-30 03:15:42,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 173 transitions, 2103 flow [2023-08-30 03:15:42,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 173 transitions, 2037 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-30 03:15:42,640 INFO L231 Difference]: Finished difference. Result has 93 places, 123 transitions, 1351 flow [2023-08-30 03:15:42,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1351, PETRI_PLACES=93, PETRI_TRANSITIONS=123} [2023-08-30 03:15:42,642 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -7 predicate places. [2023-08-30 03:15:42,642 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 123 transitions, 1351 flow [2023-08-30 03:15:42,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.66666666666666) internal successors, (856), 6 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:42,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:42,643 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-30 03:15:42,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:15:42,643 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:42,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1611121773, now seen corresponding path program 1 times [2023-08-30 03:15:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492140715] [2023-08-30 03:15:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:15:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:15:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:15:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492140715] [2023-08-30 03:15:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492140715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:15:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:15:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:15:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653969466] [2023-08-30 03:15:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:15:42,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:15:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:15:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:15:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:15:43,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 359 [2023-08-30 03:15:43,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 123 transitions, 1351 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:15:43,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 359 [2023-08-30 03:15:43,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:15:43,796 INFO L130 PetriNetUnfolder]: 2018/3216 cut-off events. [2023-08-30 03:15:43,796 INFO L131 PetriNetUnfolder]: For 8697/9100 co-relation queries the response was YES. [2023-08-30 03:15:43,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14289 conditions, 3216 events. 2018/3216 cut-off events. For 8697/9100 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 18492 event pairs, 198 based on Foata normal form. 295/3432 useless extension candidates. Maximal degree in co-relation 14265. Up to 1229 conditions per place. [2023-08-30 03:15:43,822 INFO L137 encePairwiseOnDemand]: 353/359 looper letters, 95 selfloop transitions, 17 changer transitions 1/120 dead transitions. [2023-08-30 03:15:43,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 120 transitions, 1058 flow [2023-08-30 03:15:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:15:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:15:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions. [2023-08-30 03:15:43,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43036211699164345 [2023-08-30 03:15:43,825 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 927 transitions. [2023-08-30 03:15:43,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions. [2023-08-30 03:15:43,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:15:43,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions. [2023-08-30 03:15:43,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 359.0) internal successors, (2513), 7 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,830 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 359.0) internal successors, (2513), 7 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,830 INFO L175 Difference]: Start difference. First operand has 93 places, 123 transitions, 1351 flow. Second operand 6 states and 927 transitions. [2023-08-30 03:15:43,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 120 transitions, 1058 flow [2023-08-30 03:15:43,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 120 transitions, 927 flow, removed 29 selfloop flow, removed 15 redundant places. [2023-08-30 03:15:43,901 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 388 flow [2023-08-30 03:15:43,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2023-08-30 03:15:43,902 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -23 predicate places. [2023-08-30 03:15:43,902 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 388 flow [2023-08-30 03:15:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:15:43,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:15:43,903 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-30 03:15:43,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:15:43,903 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:15:43,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:15:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash -442616910, now seen corresponding path program 1 times [2023-08-30 03:15:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:15:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746113724] [2023-08-30 03:15:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:15:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:15:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:15:44,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:15:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:15:44,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:15:44,181 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:15:44,182 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2023-08-30 03:15:44,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2023-08-30 03:15:44,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2023-08-30 03:15:44,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2023-08-30 03:15:44,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2023-08-30 03:15:44,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2023-08-30 03:15:44,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2023-08-30 03:15:44,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2023-08-30 03:15:44,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2023-08-30 03:15:44,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2023-08-30 03:15:44,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2023-08-30 03:15:44,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2023-08-30 03:15:44,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2023-08-30 03:15:44,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2023-08-30 03:15:44,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2023-08-30 03:15:44,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2023-08-30 03:15:44,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2023-08-30 03:15:44,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2023-08-30 03:15:44,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2023-08-30 03:15:44,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2023-08-30 03:15:44,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2023-08-30 03:15:44,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2023-08-30 03:15:44,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2023-08-30 03:15:44,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2023-08-30 03:15:44,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2023-08-30 03:15:44,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2023-08-30 03:15:44,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2023-08-30 03:15:44,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2023-08-30 03:15:44,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2023-08-30 03:15:44,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2023-08-30 03:15:44,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2023-08-30 03:15:44,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (32 of 88 remaining) [2023-08-30 03:15:44,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 88 remaining) [2023-08-30 03:15:44,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 88 remaining) [2023-08-30 03:15:44,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 88 remaining) [2023-08-30 03:15:44,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 88 remaining) [2023-08-30 03:15:44,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2023-08-30 03:15:44,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2023-08-30 03:15:44,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2023-08-30 03:15:44,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2023-08-30 03:15:44,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2023-08-30 03:15:44,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2023-08-30 03:15:44,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2023-08-30 03:15:44,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2023-08-30 03:15:44,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2023-08-30 03:15:44,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2023-08-30 03:15:44,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2023-08-30 03:15:44,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2023-08-30 03:15:44,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2023-08-30 03:15:44,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2023-08-30 03:15:44,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2023-08-30 03:15:44,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2023-08-30 03:15:44,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 03:15:44,198 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:15:44,204 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:15:44,204 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:15:44,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:15:44 BasicIcfg [2023-08-30 03:15:44,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:15:44,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:15:44,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:15:44,310 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:15:44,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:14:03" (3/4) ... [2023-08-30 03:15:44,313 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:15:44,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:15:44,314 INFO L158 Benchmark]: Toolchain (without parser) took 103363.39ms. Allocated memory was 71.3MB in the beginning and 12.4GB in the end (delta: 12.4GB). Free memory was 48.1MB in the beginning and 9.6GB in the end (delta: -9.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2023-08-30 03:15:44,314 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 58.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:15:44,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.01ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 42.5MB in the end (delta: 5.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:44,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.51ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 39.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:15:44,317 INFO L158 Benchmark]: Boogie Preprocessor took 69.36ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:15:44,317 INFO L158 Benchmark]: RCFGBuilder took 1696.86ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 37.1MB in the beginning and 50.2MB in the end (delta: -13.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2023-08-30 03:15:44,317 INFO L158 Benchmark]: TraceAbstraction took 100879.93ms. Allocated memory was 107.0MB in the beginning and 12.4GB in the end (delta: 12.3GB). Free memory was 49.5MB in the beginning and 9.6GB in the end (delta: -9.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2023-08-30 03:15:44,317 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 12.4GB. Free memory was 9.6GB in the beginning and 9.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:15:44,319 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.25ms. Allocated memory is still 58.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.01ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 42.5MB in the end (delta: 5.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.51ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 39.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.36ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1696.86ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 37.1MB in the beginning and 50.2MB in the end (delta: -13.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 100879.93ms. Allocated memory was 107.0MB in the beginning and 12.4GB in the end (delta: 12.3GB). Free memory was 49.5MB in the beginning and 9.6GB in the end (delta: -9.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 12.4GB. Free memory was 9.6GB in the beginning and 9.6GB 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: 15.0s, 208 PlacesBefore, 100 PlacesAfterwards, 197 TransitionsBefore, 88 TransitionsAfterwards, 8892 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 42261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10472, independent: 9754, independent conditional: 0, independent unconditional: 9754, dependent: 718, dependent conditional: 0, dependent unconditional: 718, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3438, independent: 3353, independent conditional: 0, independent unconditional: 3353, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10472, independent: 6401, independent conditional: 0, independent unconditional: 6401, dependent: 633, dependent conditional: 0, dependent unconditional: 633, unknown: 3438, unknown conditional: 0, unknown unconditional: 3438] , Statistics on independence cache: Total cache size (in pairs): 561, Positive cache size: 506, Positive conditional cache size: 0, Positive unconditional cache size: 506, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=10, t2225={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2226; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=11, t2225={7:0}, t2226={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=12, t2225={7:0}, t2226={8:0}, t2227={9:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 pthread_t t2228; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, t2227={9:0}, t2228={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=13, t2225={7:0}, t2226={8:0}, t2227={9:0}, t2228={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, t2227={9:0}, t2228={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: -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: -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: -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: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 855]: 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: 857]: 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, 260 locations, 88 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: 100.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 76.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2128 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1636 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 415 mSDsCounter, 362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3767 IncrementalHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 362 mSolverCounterUnsat, 84 mSDtfsCounter, 3767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1854occurred in iteration=16, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:15:44,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:15:47,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:15:47,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:15:47,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:15:47,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:15:47,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:15:47,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:15:47,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:15:47,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:15:47,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:15:47,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:15:47,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:15:47,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:15:47,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:15:47,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:15:47,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:15:47,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:15:47,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:15:47,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:15:47,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:15:47,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:15:47,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:15:47,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:15:47,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:15:47,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:15:47,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:15:47,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:15:47,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:15:47,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:15:47,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:15:47,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:15:47,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:15:47,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:15:47,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:15:47,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:15:47,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:15:47,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:15:47,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:15:47,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:15:47,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:15:47,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:15:47,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:15:47,168 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:15:47,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:15:47,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:15:47,169 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:15:47,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:15:47,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:15:47,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:15:47,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:15:47,171 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:15:47,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:15:47,172 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:15:47,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:15:47,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:15:47,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:15:47,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:15:47,173 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:15:47,173 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:15:47,174 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:15:47,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:15:47,174 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:15:47,174 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:15:47,174 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:15:47,174 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:15:47,175 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:15:47,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:15:47,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:15:47,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:15:47,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:15:47,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:15:47,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:15:47,176 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:15:47,176 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:15:47,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:15:47,177 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:15:47,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:15:47,177 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:15:47,177 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:15:47,177 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:15:47,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:15:47,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:15:47,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:15:47,468 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:15:47,468 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:15:47,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-30 03:15:48,795 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:15:49,082 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:15:49,083 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-08-30 03:15:49,094 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2bb96b1e/e48de5e1bcbd4180a3d22eb0e3729bf7/FLAG57118d873 [2023-08-30 03:15:49,109 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2bb96b1e/e48de5e1bcbd4180a3d22eb0e3729bf7 [2023-08-30 03:15:49,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:15:49,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:15:49,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:15:49,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:15:49,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:15:49,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41de0e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49, skipping insertion in model container [2023-08-30 03:15:49,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:15:49,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:15:49,284 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/safe019_power.oepc.i[995,1008] [2023-08-30 03:15:49,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:15:49,536 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:15:49,549 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/safe019_power.oepc.i[995,1008] [2023-08-30 03:15:49,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:15:49,650 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:15:49,650 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:15:49,656 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:15:49,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49 WrapperNode [2023-08-30 03:15:49,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:15:49,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:15:49,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:15:49,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:15:49,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,744 INFO L138 Inliner]: procedures = 181, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2023-08-30 03:15:49,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:15:49,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:15:49,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:15:49,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:15:49,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,805 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:15:49,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:15:49,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:15:49,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:15:49,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (1/1) ... [2023-08-30 03:15:49,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:15:49,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:15:49,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:15:49,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:15:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:15:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:15:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:15:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:15:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:15:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:15:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:15:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:15:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:15:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:15:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:15:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:15:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:15:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:15:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 03:15:49,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 03:15:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:15:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:15:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:15:49,910 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:15:50,081 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:15:50,083 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:15:50,930 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:15:51,764 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:15:51,764 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:15:51,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:51 BoogieIcfgContainer [2023-08-30 03:15:51,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:15:51,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:15:51,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:15:51,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:15:51,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:15:49" (1/3) ... [2023-08-30 03:15:51,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4907e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:15:51, skipping insertion in model container [2023-08-30 03:15:51,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:15:49" (2/3) ... [2023-08-30 03:15:51,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4907e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:15:51, skipping insertion in model container [2023-08-30 03:15:51,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:51" (3/3) ... [2023-08-30 03:15:51,776 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-08-30 03:15:51,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:15:51,793 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-08-30 03:15:51,793 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:15:51,970 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:15:52,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 202 transitions, 424 flow [2023-08-30 03:15:52,116 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2023-08-30 03:15:52,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:52,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 320 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-30 03:15:52,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 202 transitions, 424 flow [2023-08-30 03:15:52,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 198 transitions, 408 flow [2023-08-30 03:15:52,133 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:15:52,141 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 198 transitions, 408 flow [2023-08-30 03:15:52,144 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 198 transitions, 408 flow [2023-08-30 03:15:52,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 198 transitions, 408 flow [2023-08-30 03:15:52,231 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2023-08-30 03:15:52,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:15:52,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 327 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-30 03:15:52,238 INFO L119 LiptonReduction]: Number of co-enabled transitions 8892 [2023-08-30 03:16:18,155 INFO L134 LiptonReduction]: Checked pairs total: 42451 [2023-08-30 03:16:18,156 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-08-30 03:16:18,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:16:18,175 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;@43051b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:16:18,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2023-08-30 03:16:18,177 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:16:18,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:16:18,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:18,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:16:18,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:18,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1246, now seen corresponding path program 1 times [2023-08-30 03:16:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807926400] [2023-08-30 03:16:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:18,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:18,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:18,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:16:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:18,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:16:18,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:18,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:18,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807926400] [2023-08-30 03:16:18,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807926400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:18,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:18,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:16:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292705831] [2023-08-30 03:16:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:16:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:16:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:16:18,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 365 [2023-08-30 03:16:18,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 188 flow. Second operand has 2 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-30 03:16:18,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:18,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 365 [2023-08-30 03:16:18,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:30,097 INFO L130 PetriNetUnfolder]: 65830/87887 cut-off events. [2023-08-30 03:16:30,098 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 03:16:30,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174811 conditions, 87887 events. 65830/87887 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6089. Compared 592621 event pairs, 65830 based on Foata normal form. 0/44894 useless extension candidates. Maximal degree in co-relation 174799. Up to 86637 conditions per place. [2023-08-30 03:16:30,737 INFO L137 encePairwiseOnDemand]: 332/365 looper letters, 48 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2023-08-30 03:16:30,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 216 flow [2023-08-30 03:16:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:16:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:16:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 377 transitions. [2023-08-30 03:16:30,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164383561643836 [2023-08-30 03:16:30,757 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 377 transitions. [2023-08-30 03:16:30,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 377 transitions. [2023-08-30 03:16:30,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:30,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 377 transitions. [2023-08-30 03:16:30,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.5) internal successors, (377), 2 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:30,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:30,780 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:30,782 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 188 flow. Second operand 2 states and 377 transitions. [2023-08-30 03:16:30,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 216 flow [2023-08-30 03:16:30,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 03:16:30,801 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 116 flow [2023-08-30 03:16:30,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-08-30 03:16:30,808 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-08-30 03:16:30,809 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 116 flow [2023-08-30 03:16:30,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-30 03:16:30,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:30,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:16:30,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:31,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:31,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:31,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1230072, now seen corresponding path program 1 times [2023-08-30 03:16:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410659055] [2023-08-30 03:16:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:31,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:31,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:31,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:31,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:16:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:31,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:31,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:31,262 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:16:31,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:16:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:31,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:31,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410659055] [2023-08-30 03:16:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410659055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:31,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:31,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:16:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482680688] [2023-08-30 03:16:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:31,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:31,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:31,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 365 [2023-08-30 03:16:31,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 116 flow. Second operand has 3 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-30 03:16:31,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:31,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 365 [2023-08-30 03:16:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:37,415 INFO L130 PetriNetUnfolder]: 36815/48887 cut-off events. [2023-08-30 03:16:37,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:16:37,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97926 conditions, 48887 events. 36815/48887 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2567. Compared 297719 event pairs, 20465 based on Foata normal form. 876/30375 useless extension candidates. Maximal degree in co-relation 97923. Up to 27880 conditions per place. [2023-08-30 03:16:37,795 INFO L137 encePairwiseOnDemand]: 353/365 looper letters, 61 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-30 03:16:37,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 268 flow [2023-08-30 03:16:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-08-30 03:16:37,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557077625570776 [2023-08-30 03:16:37,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-08-30 03:16:37,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-08-30 03:16:37,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:37,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-08-30 03:16:37,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:37,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:37,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:37,805 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 116 flow. Second operand 3 states and 499 transitions. [2023-08-30 03:16:37,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 268 flow [2023-08-30 03:16:37,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 67 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:16:37,807 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 130 flow [2023-08-30 03:16:37,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-08-30 03:16:37,809 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2023-08-30 03:16:37,809 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 130 flow [2023-08-30 03:16:37,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-30 03:16:37,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:37,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:16:37,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:38,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:38,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:38,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1230073, now seen corresponding path program 1 times [2023-08-30 03:16:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660577312] [2023-08-30 03:16:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:38,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:38,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:38,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:16:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:38,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:16:38,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:38,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:16:38,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:16:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:38,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:38,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:38,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660577312] [2023-08-30 03:16:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660577312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:38,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:16:38,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560382276] [2023-08-30 03:16:38,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:38,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:38,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:38,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:38,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 365 [2023-08-30 03:16:38,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:38,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:38,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 365 [2023-08-30 03:16:38,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:40,220 INFO L130 PetriNetUnfolder]: 9226/12771 cut-off events. [2023-08-30 03:16:40,221 INFO L131 PetriNetUnfolder]: For 1038/1230 co-relation queries the response was YES. [2023-08-30 03:16:40,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28081 conditions, 12771 events. 9226/12771 cut-off events. For 1038/1230 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 71619 event pairs, 9226 based on Foata normal form. 615/11549 useless extension candidates. Maximal degree in co-relation 28076. Up to 12482 conditions per place. [2023-08-30 03:16:40,277 INFO L137 encePairwiseOnDemand]: 354/365 looper letters, 35 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-30 03:16:40,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 182 flow [2023-08-30 03:16:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-30 03:16:40,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420091324200913 [2023-08-30 03:16:40,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-30 03:16:40,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-30 03:16:40,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:40,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-30 03:16:40,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 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-30 03:16:40,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:40,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:40,285 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 130 flow. Second operand 3 states and 484 transitions. [2023-08-30 03:16:40,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 182 flow [2023-08-30 03:16:40,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:40,292 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 108 flow [2023-08-30 03:16:40,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-30 03:16:40,293 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2023-08-30 03:16:40,293 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 108 flow [2023-08-30 03:16:40,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:40,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:40,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:40,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:40,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:40,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:40,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -301389418, now seen corresponding path program 1 times [2023-08-30 03:16:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:40,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390940729] [2023-08-30 03:16:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:40,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:40,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:16:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:40,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:40,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:40,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:40,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390940729] [2023-08-30 03:16:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390940729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:16:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062408217] [2023-08-30 03:16:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:40,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:16:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:16:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:16:40,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 365 [2023-08-30 03:16:40,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:40,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:40,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 365 [2023-08-30 03:16:40,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:41,883 INFO L130 PetriNetUnfolder]: 5402/7861 cut-off events. [2023-08-30 03:16:41,883 INFO L131 PetriNetUnfolder]: For 580/696 co-relation queries the response was YES. [2023-08-30 03:16:41,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17091 conditions, 7861 events. 5402/7861 cut-off events. For 580/696 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 45193 event pairs, 2033 based on Foata normal form. 36/6742 useless extension candidates. Maximal degree in co-relation 17086. Up to 7468 conditions per place. [2023-08-30 03:16:41,915 INFO L137 encePairwiseOnDemand]: 359/365 looper letters, 49 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-30 03:16:41,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 258 flow [2023-08-30 03:16:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:16:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:16:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-30 03:16:41,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420091324200913 [2023-08-30 03:16:41,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-30 03:16:41,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-30 03:16:41,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:41,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-30 03:16:41,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 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-30 03:16:41,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:41,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:41,921 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 108 flow. Second operand 3 states and 484 transitions. [2023-08-30 03:16:41,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 258 flow [2023-08-30 03:16:41,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:41,923 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 140 flow [2023-08-30 03:16:41,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-30 03:16:41,924 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2023-08-30 03:16:41,924 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 140 flow [2023-08-30 03:16:41,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:41,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:41,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:41,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:42,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:42,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:42,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:42,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1945208865, now seen corresponding path program 1 times [2023-08-30 03:16:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467719728] [2023-08-30 03:16:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:42,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:42,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:42,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:16:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:42,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:16:42,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:42,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:42,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467719728] [2023-08-30 03:16:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467719728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:16:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735169452] [2023-08-30 03:16:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:16:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:42,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:16:42,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:16:42,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 365 [2023-08-30 03:16:42,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:42,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:42,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 365 [2023-08-30 03:16:42,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:42,931 INFO L130 PetriNetUnfolder]: 1766/2845 cut-off events. [2023-08-30 03:16:42,931 INFO L131 PetriNetUnfolder]: For 613/645 co-relation queries the response was YES. [2023-08-30 03:16:42,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6950 conditions, 2845 events. 1766/2845 cut-off events. For 613/645 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15443 event pairs, 499 based on Foata normal form. 60/2533 useless extension candidates. Maximal degree in co-relation 6944. Up to 2226 conditions per place. [2023-08-30 03:16:42,944 INFO L137 encePairwiseOnDemand]: 359/365 looper letters, 60 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-08-30 03:16:42,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 354 flow [2023-08-30 03:16:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2023-08-30 03:16:42,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4397260273972603 [2023-08-30 03:16:42,947 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2023-08-30 03:16:42,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2023-08-30 03:16:42,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:42,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2023-08-30 03:16:42,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:42,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:42,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:42,953 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 140 flow. Second operand 4 states and 642 transitions. [2023-08-30 03:16:42,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 354 flow [2023-08-30 03:16:42,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:42,957 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 187 flow [2023-08-30 03:16:42,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-30 03:16:42,958 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2023-08-30 03:16:42,958 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 187 flow [2023-08-30 03:16:42,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:42,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:42,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:42,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:43,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:43,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 899136774, now seen corresponding path program 1 times [2023-08-30 03:16:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19571759] [2023-08-30 03:16:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:43,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:43,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:43,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:16:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:43,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:16:43,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:43,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:43,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19571759] [2023-08-30 03:16:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19571759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:43,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:43,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:16:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187149851] [2023-08-30 03:16:43,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:43,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:16:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:43,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:16:43,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:16:43,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 365 [2023-08-30 03:16:43,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:43,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:43,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 365 [2023-08-30 03:16:43,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:43,912 INFO L130 PetriNetUnfolder]: 638/1071 cut-off events. [2023-08-30 03:16:43,912 INFO L131 PetriNetUnfolder]: For 768/771 co-relation queries the response was YES. [2023-08-30 03:16:43,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 1071 events. 638/1071 cut-off events. For 768/771 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4662 event pairs, 148 based on Foata normal form. 37/1043 useless extension candidates. Maximal degree in co-relation 3046. Up to 342 conditions per place. [2023-08-30 03:16:43,917 INFO L137 encePairwiseOnDemand]: 359/365 looper letters, 69 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2023-08-30 03:16:43,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 455 flow [2023-08-30 03:16:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:16:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:16:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 798 transitions. [2023-08-30 03:16:43,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43726027397260275 [2023-08-30 03:16:43,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 798 transitions. [2023-08-30 03:16:43,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 798 transitions. [2023-08-30 03:16:43,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:43,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 798 transitions. [2023-08-30 03:16:43,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.6) internal successors, (798), 5 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:43,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:43,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:43,930 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 187 flow. Second operand 5 states and 798 transitions. [2023-08-30 03:16:43,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 87 transitions, 455 flow [2023-08-30 03:16:43,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 437 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:43,933 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 237 flow [2023-08-30 03:16:43,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-08-30 03:16:43,934 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2023-08-30 03:16:43,934 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 237 flow [2023-08-30 03:16:43,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:43,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:43,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:43,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:44,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:44,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:44,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash 932442385, now seen corresponding path program 1 times [2023-08-30 03:16:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568297911] [2023-08-30 03:16:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:44,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:44,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:44,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:44,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:16:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:44,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 03:16:44,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:44,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:44,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:44,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568297911] [2023-08-30 03:16:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568297911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:44,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:16:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452283914] [2023-08-30 03:16:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:44,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:16:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:16:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:16:44,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 365 [2023-08-30 03:16:44,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:44,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:44,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 365 [2023-08-30 03:16:44,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:44,973 INFO L130 PetriNetUnfolder]: 520/818 cut-off events. [2023-08-30 03:16:44,973 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2023-08-30 03:16:44,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 818 events. 520/818 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3338 event pairs, 120 based on Foata normal form. 10/817 useless extension candidates. Maximal degree in co-relation 2498. Up to 342 conditions per place. [2023-08-30 03:16:44,978 INFO L137 encePairwiseOnDemand]: 359/365 looper letters, 58 selfloop transitions, 17 changer transitions 1/80 dead transitions. [2023-08-30 03:16:44,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 441 flow [2023-08-30 03:16:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:16:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:16:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 935 transitions. [2023-08-30 03:16:44,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269406392694064 [2023-08-30 03:16:44,981 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 935 transitions. [2023-08-30 03:16:44,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 935 transitions. [2023-08-30 03:16:44,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:44,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 935 transitions. [2023-08-30 03:16:44,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:44,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 365.0) internal successors, (2555), 7 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:44,988 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 365.0) internal successors, (2555), 7 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:44,988 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 237 flow. Second operand 6 states and 935 transitions. [2023-08-30 03:16:44,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 441 flow [2023-08-30 03:16:44,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 405 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-30 03:16:44,998 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 215 flow [2023-08-30 03:16:44,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-30 03:16:44,999 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2023-08-30 03:16:44,999 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 215 flow [2023-08-30 03:16:45,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:45,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:45,000 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-30 03:16:45,009 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-30 03:16:45,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:45,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:45,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1575265277, now seen corresponding path program 1 times [2023-08-30 03:16:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:45,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345534618] [2023-08-30 03:16:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:45,206 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:45,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 03:16:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:45,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:16:45,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:47,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:47,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:47,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:47,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345534618] [2023-08-30 03:16:47,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345534618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:47,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:47,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:16:47,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240816778] [2023-08-30 03:16:47,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:47,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:16:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:47,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:16:47,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:16:47,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 365 [2023-08-30 03:16:47,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:47,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:47,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 365 [2023-08-30 03:16:47,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:47,397 INFO L130 PetriNetUnfolder]: 520/905 cut-off events. [2023-08-30 03:16:47,397 INFO L131 PetriNetUnfolder]: For 1269/1269 co-relation queries the response was YES. [2023-08-30 03:16:47,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 905 events. 520/905 cut-off events. For 1269/1269 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4248 event pairs, 99 based on Foata normal form. 0/899 useless extension candidates. Maximal degree in co-relation 2633. Up to 602 conditions per place. [2023-08-30 03:16:47,401 INFO L137 encePairwiseOnDemand]: 362/365 looper letters, 60 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 03:16:47,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 438 flow [2023-08-30 03:16:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2023-08-30 03:16:47,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43082191780821916 [2023-08-30 03:16:47,403 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 629 transitions. [2023-08-30 03:16:47,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 629 transitions. [2023-08-30 03:16:47,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:47,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 629 transitions. [2023-08-30 03:16:47,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:47,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:47,407 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:47,407 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 215 flow. Second operand 4 states and 629 transitions. [2023-08-30 03:16:47,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 438 flow [2023-08-30 03:16:47,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 373 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-30 03:16:47,413 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 167 flow [2023-08-30 03:16:47,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-30 03:16:47,414 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2023-08-30 03:16:47,414 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 167 flow [2023-08-30 03:16:47,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:47,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:47,414 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-30 03:16:47,425 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-30 03:16:47,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:47,626 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:47,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1375246040, now seen corresponding path program 1 times [2023-08-30 03:16:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566418835] [2023-08-30 03:16:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:47,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:47,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 03:16:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:47,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 03:16:47,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:48,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-30 03:16:48,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:49,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:49,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:49,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566418835] [2023-08-30 03:16:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566418835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:16:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584269457] [2023-08-30 03:16:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:49,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:16:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:16:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:16:49,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 365 [2023-08-30 03:16:49,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:49,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:49,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 365 [2023-08-30 03:16:49,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:49,764 INFO L130 PetriNetUnfolder]: 520/827 cut-off events. [2023-08-30 03:16:49,764 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2023-08-30 03:16:49,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 827 events. 520/827 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3326 event pairs, 255 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 2392. Up to 601 conditions per place. [2023-08-30 03:16:49,768 INFO L137 encePairwiseOnDemand]: 362/365 looper letters, 59 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-30 03:16:49,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 373 flow [2023-08-30 03:16:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2023-08-30 03:16:49,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246575342465753 [2023-08-30 03:16:49,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 620 transitions. [2023-08-30 03:16:49,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 620 transitions. [2023-08-30 03:16:49,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:49,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 620 transitions. [2023-08-30 03:16:49,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:49,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:49,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:49,774 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 167 flow. Second operand 4 states and 620 transitions. [2023-08-30 03:16:49,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 373 flow [2023-08-30 03:16:49,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:49,779 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 166 flow [2023-08-30 03:16:49,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 03:16:49,780 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2023-08-30 03:16:49,780 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 166 flow [2023-08-30 03:16:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:49,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:49,781 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-30 03:16:49,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-30 03:16:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:49,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:49,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1811165068, now seen corresponding path program 1 times [2023-08-30 03:16:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023918621] [2023-08-30 03:16:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:16:49,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:49,987 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:49,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 03:16:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:16:50,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:16:50,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:50,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:50,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:50,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023918621] [2023-08-30 03:16:50,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023918621] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:50,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:50,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:16:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103617146] [2023-08-30 03:16:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:50,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:16:50,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:16:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:16:50,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 365 [2023-08-30 03:16:50,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:50,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:50,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 365 [2023-08-30 03:16:50,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:50,585 INFO L130 PetriNetUnfolder]: 912/1428 cut-off events. [2023-08-30 03:16:50,585 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2023-08-30 03:16:50,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4231 conditions, 1428 events. 912/1428 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6631 event pairs, 154 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 4223. Up to 743 conditions per place. [2023-08-30 03:16:50,592 INFO L137 encePairwiseOnDemand]: 362/365 looper letters, 89 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-30 03:16:50,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 561 flow [2023-08-30 03:16:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2023-08-30 03:16:50,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436986301369863 [2023-08-30 03:16:50,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2023-08-30 03:16:50,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2023-08-30 03:16:50,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:50,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2023-08-30 03:16:50,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:50,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:50,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:50,600 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 166 flow. Second operand 4 states and 638 transitions. [2023-08-30 03:16:50,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 561 flow [2023-08-30 03:16:50,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:50,613 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 176 flow [2023-08-30 03:16:50,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-08-30 03:16:50,615 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2023-08-30 03:16:50,615 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 176 flow [2023-08-30 03:16:50,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:50,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:50,615 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-30 03:16:50,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:50,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:50,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:50,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1034317258, now seen corresponding path program 2 times [2023-08-30 03:16:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733134726] [2023-08-30 03:16:50,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:16:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:50,828 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-30 03:16:50,829 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-30 03:16:51,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:16:51,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:51,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:16:51,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:51,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:51,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733134726] [2023-08-30 03:16:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733134726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:51,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:16:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803271855] [2023-08-30 03:16:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:51,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:16:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:51,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:16:51,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:16:51,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 365 [2023-08-30 03:16:51,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:51,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:51,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 365 [2023-08-30 03:16:51,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:51,468 INFO L130 PetriNetUnfolder]: 1079/1804 cut-off events. [2023-08-30 03:16:51,468 INFO L131 PetriNetUnfolder]: For 1790/1806 co-relation queries the response was YES. [2023-08-30 03:16:51,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 1804 events. 1079/1804 cut-off events. For 1790/1806 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9542 event pairs, 184 based on Foata normal form. 1/1771 useless extension candidates. Maximal degree in co-relation 5598. Up to 862 conditions per place. [2023-08-30 03:16:51,475 INFO L137 encePairwiseOnDemand]: 361/365 looper letters, 84 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2023-08-30 03:16:51,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 556 flow [2023-08-30 03:16:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:16:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:16:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2023-08-30 03:16:51,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43424657534246575 [2023-08-30 03:16:51,477 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 634 transitions. [2023-08-30 03:16:51,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions. [2023-08-30 03:16:51,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:51,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions. [2023-08-30 03:16:51,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:51,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:51,481 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 365.0) internal successors, (1825), 5 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:51,482 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 176 flow. Second operand 4 states and 634 transitions. [2023-08-30 03:16:51,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 556 flow [2023-08-30 03:16:51,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:16:51,495 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 189 flow [2023-08-30 03:16:51,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-30 03:16:51,495 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2023-08-30 03:16:51,495 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 189 flow [2023-08-30 03:16:51,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:51,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:51,496 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-30 03:16:51,504 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-30 03:16:51,696 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-30 03:16:51,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:51,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1493248020, now seen corresponding path program 3 times [2023-08-30 03:16:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383962014] [2023-08-30 03:16:51,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:16:51,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:51,698 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-30 03:16:51,699 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-30 03:16:51,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:16:51,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:51,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 03:16:51,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:52,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:16:52,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:52,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:52,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:52,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:52,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:52,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383962014] [2023-08-30 03:16:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383962014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:52,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:16:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360556634] [2023-08-30 03:16:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:16:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:16:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:16:52,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 365 [2023-08-30 03:16:52,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:52,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:52,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 365 [2023-08-30 03:16:52,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:53,086 INFO L130 PetriNetUnfolder]: 2163/3466 cut-off events. [2023-08-30 03:16:53,086 INFO L131 PetriNetUnfolder]: For 4733/4738 co-relation queries the response was YES. [2023-08-30 03:16:53,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11425 conditions, 3466 events. 2163/3466 cut-off events. For 4733/4738 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 19498 event pairs, 674 based on Foata normal form. 1/3412 useless extension candidates. Maximal degree in co-relation 11414. Up to 2232 conditions per place. [2023-08-30 03:16:53,100 INFO L137 encePairwiseOnDemand]: 357/365 looper letters, 67 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-08-30 03:16:53,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 472 flow [2023-08-30 03:16:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:16:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:16:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-08-30 03:16:53,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38904109589041097 [2023-08-30 03:16:53,103 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-08-30 03:16:53,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-08-30 03:16:53,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:53,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-08-30 03:16:53,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:53,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:53,107 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:53,107 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 189 flow. Second operand 5 states and 710 transitions. [2023-08-30 03:16:53,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 472 flow [2023-08-30 03:16:53,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:53,135 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 229 flow [2023-08-30 03:16:53,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-08-30 03:16:53,136 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2023-08-30 03:16:53,136 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 229 flow [2023-08-30 03:16:53,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:53,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:53,137 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-30 03:16:53,148 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-30 03:16:53,348 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-30 03:16:53,348 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:53,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1386285186, now seen corresponding path program 4 times [2023-08-30 03:16:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:53,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044337972] [2023-08-30 03:16:53,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:16:53,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:53,350 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:53,352 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 (14)] Waiting until timeout for monitored process [2023-08-30 03:16:53,574 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:16:53,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:16:53,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-30 03:16:53,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:16:55,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:55,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:55,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:16:55,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:55,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:55,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:16:55,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:55,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 03:16:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:16:55,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:16:55,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:16:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044337972] [2023-08-30 03:16:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044337972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:16:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:16:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:16:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103843228] [2023-08-30 03:16:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:16:55,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:16:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:16:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:16:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:16:56,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 365 [2023-08-30 03:16:56,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 135.125) internal successors, (1081), 8 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:56,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:16:56,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 365 [2023-08-30 03:16:56,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:16:57,097 INFO L130 PetriNetUnfolder]: 2582/4173 cut-off events. [2023-08-30 03:16:57,097 INFO L131 PetriNetUnfolder]: For 5546/5551 co-relation queries the response was YES. [2023-08-30 03:16:57,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15135 conditions, 4173 events. 2582/4173 cut-off events. For 5546/5551 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 24680 event pairs, 796 based on Foata normal form. 1/4103 useless extension candidates. Maximal degree in co-relation 15123. Up to 2206 conditions per place. [2023-08-30 03:16:57,115 INFO L137 encePairwiseOnDemand]: 359/365 looper letters, 71 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2023-08-30 03:16:57,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 531 flow [2023-08-30 03:16:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:16:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:16:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-08-30 03:16:57,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38904109589041097 [2023-08-30 03:16:57,118 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-08-30 03:16:57,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-08-30 03:16:57,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:16:57,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-08-30 03:16:57,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:57,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:57,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:57,122 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 229 flow. Second operand 5 states and 710 transitions. [2023-08-30 03:16:57,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 531 flow [2023-08-30 03:16:57,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:16:57,165 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 265 flow [2023-08-30 03:16:57,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2023-08-30 03:16:57,166 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2023-08-30 03:16:57,166 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 265 flow [2023-08-30 03:16:57,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 135.125) internal successors, (1081), 8 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:16:57,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:16:57,167 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-30 03:16:57,175 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 (14)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:57,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:57,368 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-08-30 03:16:57,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:16:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash 648991810, now seen corresponding path program 5 times [2023-08-30 03:16:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:16:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882162037] [2023-08-30 03:16:57,369 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 03:16:57,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:57,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:16:57,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:16:57,371 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 (15)] Waiting until timeout for monitored process [2023-08-30 03:16:57,626 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:16:57,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:16:57,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:16:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:16:57,905 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:16:57,906 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:16:57,907 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2023-08-30 03:16:57,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2023-08-30 03:16:57,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2023-08-30 03:16:57,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2023-08-30 03:16:57,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2023-08-30 03:16:57,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2023-08-30 03:16:57,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2023-08-30 03:16:57,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2023-08-30 03:16:57,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2023-08-30 03:16:57,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2023-08-30 03:16:57,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2023-08-30 03:16:57,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (32 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2023-08-30 03:16:57,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2023-08-30 03:16:57,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2023-08-30 03:16:57,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2023-08-30 03:16:57,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2023-08-30 03:16:57,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2023-08-30 03:16:57,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2023-08-30 03:16:57,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2023-08-30 03:16:57,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2023-08-30 03:16:57,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2023-08-30 03:16:57,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2023-08-30 03:16:57,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2023-08-30 03:16:57,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2023-08-30 03:16:57,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2023-08-30 03:16:57,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2023-08-30 03:16:57,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2023-08-30 03:16:57,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2023-08-30 03:16:57,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2023-08-30 03:16:57,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2023-08-30 03:16:57,940 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 (15)] Forceful destruction successful, exit code 0 [2023-08-30 03:16:58,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:16:58,137 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:16:58,143 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:16:58,143 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:16:58,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:16:58 BasicIcfg [2023-08-30 03:16:58,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:16:58,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:16:58,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:16:58,261 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:16:58,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:15:51" (3/4) ... [2023-08-30 03:16:58,264 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:16:58,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:16:58,264 INFO L158 Benchmark]: Toolchain (without parser) took 69151.41ms. Allocated memory was 79.7MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 51.9MB in the beginning and 8.1GB in the end (delta: -8.1GB). Peak memory consumption was 886.2MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,264 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:16:58,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.56ms. Allocated memory is still 79.7MB. Free memory was 51.7MB in the beginning and 45.2MB in the end (delta: 6.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.51ms. Allocated memory is still 79.7MB. Free memory was 44.8MB in the beginning and 42.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,265 INFO L158 Benchmark]: Boogie Preprocessor took 77.04ms. Allocated memory is still 79.7MB. Free memory was 42.2MB in the beginning and 39.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,266 INFO L158 Benchmark]: RCFGBuilder took 1941.88ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 52.0MB in the end (delta: -12.7MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,266 INFO L158 Benchmark]: TraceAbstraction took 66491.09ms. Allocated memory was 102.8MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 50.7MB in the beginning and 8.1GB in the end (delta: -8.1GB). Peak memory consumption was 859.3MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,267 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 9.1GB. Free memory was 8.1GB in the beginning and 8.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:16:58,271 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 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.56ms. Allocated memory is still 79.7MB. Free memory was 51.7MB in the beginning and 45.2MB in the end (delta: 6.4MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.51ms. Allocated memory is still 79.7MB. Free memory was 44.8MB in the beginning and 42.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.04ms. Allocated memory is still 79.7MB. Free memory was 42.2MB in the beginning and 39.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1941.88ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 52.0MB in the end (delta: -12.7MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * TraceAbstraction took 66491.09ms. Allocated memory was 102.8MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 50.7MB in the beginning and 8.1GB in the end (delta: -8.1GB). Peak memory consumption was 859.3MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 9.1GB. Free memory was 8.1GB in the beginning and 8.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.0s, 209 PlacesBefore, 100 PlacesAfterwards, 198 TransitionsBefore, 88 TransitionsAfterwards, 8892 CoEnabledTransitionPairs, 7 FixpointIterations, 77 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 163 TotalNumberOfCompositions, 42451 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11398, independent: 10678, independent conditional: 0, independent unconditional: 10678, dependent: 720, dependent conditional: 0, dependent unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3503, independent: 3418, independent conditional: 0, independent unconditional: 3418, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11398, independent: 7260, independent conditional: 0, independent unconditional: 7260, dependent: 635, dependent conditional: 0, dependent unconditional: 635, unknown: 3503, unknown conditional: 0, unknown unconditional: 3503] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 559, Positive conditional cache size: 0, Positive unconditional cache size: 559, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=-1, t2225={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2226; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={15:0}, t2226={23:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=0, t2225={15:0}, t2226={23:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=1, t2225={15:0}, t2226={23:0}, t2227={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 pthread_t t2228; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={15:0}, t2226={23:0}, t2227={7:0}, t2228={1024:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=2, t2225={15:0}, t2226={23:0}, t2227={7:0}, t2228={1024:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L829] 4 y = 2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={15:0}, t2226={23:0}, t2227={7:0}, t2228={1024:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: -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: -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: -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: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 855]: 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: 857]: 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, 261 locations, 88 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: 66.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 753 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 348 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2124 IncrementalHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 34 mSDtfsCounter, 2124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=13, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 2097 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2340 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:16:58,316 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