./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.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/mix008_power.oepc_pso.oepc_rmo.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 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:44:02,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:44:02,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:44:02,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:44:02,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:44:02,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:44:02,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:44:02,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:44:02,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:44:02,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:44:02,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:44:02,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:44:02,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:44:02,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:44:02,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:44:02,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:44:02,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:44:02,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:44:02,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:44:02,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:44:02,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:44:02,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:44:02,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:44:02,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:44:02,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:44:02,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:44:02,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:44:02,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:44:02,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:44:02,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:44:02,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:44:02,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:44:02,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:44:02,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:44:02,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:44:02,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:44:02,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:44:02,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:44:02,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:44:02,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:44:02,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:44:02,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:44:02,808 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:44:02,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:44:02,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:44:02,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:44:02,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:44:02,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:44:02,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:44:02,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:44:02,810 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:44:02,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:44:02,811 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:44:02,811 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:44:02,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:44:02,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:44:02,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:44:02,811 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:44:02,812 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:44:02,812 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:44:02,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:44:02,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:44:02,812 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:44:02,812 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:44:02,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:44:02,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:44:02,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:44:02,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:02,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:44:02,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:44:02,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:44:02,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:44:02,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:44:02,814 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:44:02,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:44:02,814 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:44:02,814 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 -> 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:44:03,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:44:03,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:44:03,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:44:03,089 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:44:03,089 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:44:03,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:44:03,991 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:44:04,235 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:44:04,236 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:44:04,253 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea700ebce/ed382a1c3a494e8ea54e6a9efcf391f1/FLAG95e2fc054 [2023-08-30 02:44:04,268 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea700ebce/ed382a1c3a494e8ea54e6a9efcf391f1 [2023-08-30 02:44:04,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:44:04,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:44:04,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:04,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:44:04,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:44:04,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bccc2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04, skipping insertion in model container [2023-08-30 02:44:04,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:44:04,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:44:04,464 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:44:04,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:04,618 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:44:04,625 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:44:04,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:04,711 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:04,712 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:04,716 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:44:04,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04 WrapperNode [2023-08-30 02:44:04,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:04,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:04,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:44:04,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:44:04,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,753 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 02:44:04,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:04,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:44:04,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:44:04,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:44:04,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,796 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:44:04,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:44:04,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:44:04,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:44:04,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (1/1) ... [2023-08-30 02:44:04,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:04,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:44:04,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:44:04,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:44:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:44:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:44:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:44:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:44:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:44:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:44:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:44:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:44:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:44:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:44:04,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:44:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:44:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:44:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:44:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:44:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:44:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:44:04,847 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:44:04,985 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:44:04,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:44:05,326 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:44:05,422 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:44:05,423 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:44:05,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:05 BoogieIcfgContainer [2023-08-30 02:44:05,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:44:05,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:44:05,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:44:05,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:44:05,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:44:04" (1/3) ... [2023-08-30 02:44:05,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13906ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:05, skipping insertion in model container [2023-08-30 02:44:05,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:04" (2/3) ... [2023-08-30 02:44:05,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13906ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:05, skipping insertion in model container [2023-08-30 02:44:05,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:05" (3/3) ... [2023-08-30 02:44:05,431 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:44:05,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:44:05,443 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:44:05,443 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:44:05,491 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:44:05,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:44:05,581 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:44:05,581 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:05,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:05,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-30 02:44:05,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-30 02:44:05,594 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:44:05,603 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:44:05,606 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-30 02:44:05,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-30 02:44:05,653 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-30 02:44:05,653 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:05,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:05,657 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-30 02:44:09,304 INFO L134 LiptonReduction]: Checked pairs total: 11356 [2023-08-30 02:44:09,304 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-30 02:44:09,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:44:09,317 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76e0206f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:44:09,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:44:09,319 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:44:09,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:09,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:09,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:44:09,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:09,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2023-08-30 02:44:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476900425] [2023-08-30 02:44:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476900425] [2023-08-30 02:44:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476900425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:44:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453725587] [2023-08-30 02:44:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:09,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:44:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:44:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:44:09,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 280 [2023-08-30 02:44:09,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:09,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:09,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 280 [2023-08-30 02:44:09,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:10,620 INFO L130 PetriNetUnfolder]: 8719/11885 cut-off events. [2023-08-30 02:44:10,621 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2023-08-30 02:44:10,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23833 conditions, 11885 events. 8719/11885 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 63989 event pairs, 8719 based on Foata normal form. 0/10377 useless extension candidates. Maximal degree in co-relation 23821. Up to 11731 conditions per place. [2023-08-30 02:44:10,687 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-30 02:44:10,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-30 02:44:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:44:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:44:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-30 02:44:10,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2023-08-30 02:44:10,701 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-30 02:44:10,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-30 02:44:10,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:10,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-30 02:44:10,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 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 02:44:10,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:10,712 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:10,713 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 295 transitions. [2023-08-30 02:44:10,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-30 02:44:10,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:10,720 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-30 02:44:10,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-30 02:44:10,723 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-30 02:44:10,724 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-30 02:44:10,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:10,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:10,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:44:10,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:44:10,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:10,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash 600364, now seen corresponding path program 1 times [2023-08-30 02:44:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589624192] [2023-08-30 02:44:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589624192] [2023-08-30 02:44:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589624192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:44:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918550695] [2023-08-30 02:44:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:10,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:10,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:10,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 280 [2023-08-30 02:44:10,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:10,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:10,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 280 [2023-08-30 02:44:10,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:11,711 INFO L130 PetriNetUnfolder]: 6855/9365 cut-off events. [2023-08-30 02:44:11,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:11,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18802 conditions, 9365 events. 6855/9365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 48314 event pairs, 3527 based on Foata normal form. 0/8702 useless extension candidates. Maximal degree in co-relation 18799. Up to 7399 conditions per place. [2023-08-30 02:44:11,746 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-30 02:44:11,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-30 02:44:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-30 02:44:11,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2023-08-30 02:44:11,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-30 02:44:11,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-30 02:44:11,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:11,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-30 02:44:11,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:11,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:11,751 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:11,751 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 434 transitions. [2023-08-30 02:44:11,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-30 02:44:11,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:44:11,753 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-30 02:44:11,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:44:11,753 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-30 02:44:11,753 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-30 02:44:11,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:11,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:11,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:11,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:44:11,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:11,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash -697057832, now seen corresponding path program 1 times [2023-08-30 02:44:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:11,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99314604] [2023-08-30 02:44:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99314604] [2023-08-30 02:44:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99314604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:44:12,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367782965] [2023-08-30 02:44:12,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:12,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:12,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-30 02:44:12,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:12,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:12,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-30 02:44:12,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:14,638 INFO L130 PetriNetUnfolder]: 31165/41738 cut-off events. [2023-08-30 02:44:14,638 INFO L131 PetriNetUnfolder]: For 1931/1931 co-relation queries the response was YES. [2023-08-30 02:44:14,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85997 conditions, 41738 events. 31165/41738 cut-off events. For 1931/1931 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 231097 event pairs, 11139 based on Foata normal form. 0/40878 useless extension candidates. Maximal degree in co-relation 85993. Up to 23916 conditions per place. [2023-08-30 02:44:14,825 INFO L137 encePairwiseOnDemand]: 269/280 looper letters, 47 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2023-08-30 02:44:14,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2023-08-30 02:44:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-30 02:44:14,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-30 02:44:14,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-30 02:44:14,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-30 02:44:14,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:14,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-30 02:44:14,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:14,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:14,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:14,830 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 406 transitions. [2023-08-30 02:44:14,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2023-08-30 02:44:14,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:14,833 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2023-08-30 02:44:14,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-30 02:44:14,834 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-30 02:44:14,836 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2023-08-30 02:44:14,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:14,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:14,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:14,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:44:14,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:14,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -133959096, now seen corresponding path program 1 times [2023-08-30 02:44:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207154863] [2023-08-30 02:44:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207154863] [2023-08-30 02:44:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207154863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:44:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397467773] [2023-08-30 02:44:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:15,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:15,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-30 02:44:15,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:15,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:15,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-30 02:44:15,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:17,464 INFO L130 PetriNetUnfolder]: 23505/32961 cut-off events. [2023-08-30 02:44:17,464 INFO L131 PetriNetUnfolder]: For 15298/15731 co-relation queries the response was YES. [2023-08-30 02:44:17,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81616 conditions, 32961 events. 23505/32961 cut-off events. For 15298/15731 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 206812 event pairs, 6756 based on Foata normal form. 331/32351 useless extension candidates. Maximal degree in co-relation 81611. Up to 20824 conditions per place. [2023-08-30 02:44:17,668 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 48 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-30 02:44:17,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 308 flow [2023-08-30 02:44:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-30 02:44:17,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2023-08-30 02:44:17,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-30 02:44:17,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-30 02:44:17,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:17,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-30 02:44:17,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:17,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:17,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:17,674 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 3 states and 425 transitions. [2023-08-30 02:44:17,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 308 flow [2023-08-30 02:44:17,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:17,726 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 139 flow [2023-08-30 02:44:17,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-30 02:44:17,727 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-08-30 02:44:17,727 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 139 flow [2023-08-30 02:44:17,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:17,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:17,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:17,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:44:17,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:17,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash -133955475, now seen corresponding path program 1 times [2023-08-30 02:44:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359531691] [2023-08-30 02:44:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359531691] [2023-08-30 02:44:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359531691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253555660] [2023-08-30 02:44:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:18,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:18,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:18,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:18,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-30 02:44:18,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:18,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:18,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-30 02:44:18,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:19,315 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [26#L773true, 41#L809true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, 12#L829true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-30 02:44:19,315 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,315 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,316 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,316 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,316 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:19,316 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,316 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,316 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,317 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,317 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [26#L773true, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-30 02:44:19,317 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,317 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,317 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,318 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 133#L887true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-30 02:44:19,318 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,318 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [26#L773true, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:19,538 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [26#L773true, 41#L809true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 66#L786true, 133#L887true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, 12#L829true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-30 02:44:19,538 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,538 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 133#L887true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:19,539 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [110#P0EXITtrue, 41#L809true, 66#L786true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 12#L829true, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-30 02:44:19,539 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:19,540 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [110#P0EXITtrue, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-30 02:44:19,541 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 133#L887true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 119#L793true, 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-30 02:44:19,541 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:19,766 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L887-->L873-3: Formula: (and (= (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t209~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t210~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t211~0#1.base_52| 0) |v_#valid_206|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_26 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~__unbuffered_p3_EAX~0_22 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_53|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start_main_~#t210~0#1.base=|v_ULTIMATE.start_main_~#t210~0#1.base_39|, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start_main_~#t210~0#1.offset=|v_ULTIMATE.start_main_~#t210~0#1.offset_33|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_37|, ULTIMATE.start_main_~#t211~0#1.base=|v_ULTIMATE.start_main_~#t211~0#1.base_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t210~0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base, ULTIMATE.start_main_~#t210~0#1.base][51], [110#P0EXITtrue, 32#L873-3true, 41#L809true, Black: 165#true, 66#L786true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:19,767 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,767 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][45], [110#P0EXITtrue, 41#L809true, 66#L786true, 133#L887true, Black: 167#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 171#true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 12#L829true, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 176#true]) [2023-08-30 02:44:19,767 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 133#L887true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 119#L793true, 171#true, 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:19,768 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:19,768 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:20,792 INFO L130 PetriNetUnfolder]: 22623/31801 cut-off events. [2023-08-30 02:44:20,792 INFO L131 PetriNetUnfolder]: For 6968/7075 co-relation queries the response was YES. [2023-08-30 02:44:20,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74095 conditions, 31801 events. 22623/31801 cut-off events. For 6968/7075 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 196546 event pairs, 3727 based on Foata normal form. 1458/32093 useless extension candidates. Maximal degree in co-relation 74089. Up to 20048 conditions per place. [2023-08-30 02:44:20,928 INFO L137 encePairwiseOnDemand]: 272/280 looper letters, 59 selfloop transitions, 6 changer transitions 20/93 dead transitions. [2023-08-30 02:44:20,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 453 flow [2023-08-30 02:44:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-30 02:44:20,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4372448979591837 [2023-08-30 02:44:20,935 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-30 02:44:20,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-30 02:44:20,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:20,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-30 02:44:20,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:20,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:20,945 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:20,945 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 139 flow. Second operand 7 states and 857 transitions. [2023-08-30 02:44:20,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 453 flow [2023-08-30 02:44:20,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:20,956 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 156 flow [2023-08-30 02:44:20,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-30 02:44:20,959 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-30 02:44:20,959 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 156 flow [2023-08-30 02:44:20,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:20,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:20,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:20,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:44:20,960 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:20,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 36107091, now seen corresponding path program 1 times [2023-08-30 02:44:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:20,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565069464] [2023-08-30 02:44:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:20,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565069464] [2023-08-30 02:44:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565069464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237447629] [2023-08-30 02:44:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:21,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:21,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-08-30 02:44:21,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:21,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:21,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-08-30 02:44:21,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:22,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:22,214 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,214 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,214 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,214 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 133#L887true, 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-30 02:44:22,215 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,215 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,215 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,216 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:22,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [26#L773true, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 133#L887true, 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:22,379 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,379 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,379 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,379 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:22,379 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,380 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,380 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,380 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 133#L887true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 158#true, 119#L793true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 45#$Ultimate##0true, P3Thread1of1ForFork0InUse]) [2023-08-30 02:44:22,380 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,381 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,381 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,381 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:22,655 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [110#P0EXITtrue, 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 133#L887true, 119#L793true, 158#true, Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 181#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, 126#L826true]) [2023-08-30 02:44:22,655 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:44:22,655 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:22,655 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:22,655 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:23,442 INFO L130 PetriNetUnfolder]: 16178/22634 cut-off events. [2023-08-30 02:44:23,442 INFO L131 PetriNetUnfolder]: For 10127/10443 co-relation queries the response was YES. [2023-08-30 02:44:23,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55560 conditions, 22634 events. 16178/22634 cut-off events. For 10127/10443 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 136065 event pairs, 3384 based on Foata normal form. 1010/22524 useless extension candidates. Maximal degree in co-relation 55552. Up to 15668 conditions per place. [2023-08-30 02:44:23,550 INFO L137 encePairwiseOnDemand]: 274/280 looper letters, 43 selfloop transitions, 4 changer transitions 17/74 dead transitions. [2023-08-30 02:44:23,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 372 flow [2023-08-30 02:44:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-08-30 02:44:23,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2023-08-30 02:44:23,554 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-08-30 02:44:23,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-08-30 02:44:23,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:23,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-08-30 02:44:23,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:23,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:23,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:23,561 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 156 flow. Second operand 7 states and 826 transitions. [2023-08-30 02:44:23,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 372 flow [2023-08-30 02:44:23,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 360 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:44:23,566 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 136 flow [2023-08-30 02:44:23,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-30 02:44:23,568 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-30 02:44:23,568 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 136 flow [2023-08-30 02:44:23,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.85714285714286) internal successors, (783), 7 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:23,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:23,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:23,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:44:23,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:23,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1119247039, now seen corresponding path program 1 times [2023-08-30 02:44:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716948783] [2023-08-30 02:44:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716948783] [2023-08-30 02:44:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716948783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:44:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489375501] [2023-08-30 02:44:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:23,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:23,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:23,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-30 02:44:23,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:23,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:23,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-30 02:44:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:25,518 INFO L130 PetriNetUnfolder]: 17095/23194 cut-off events. [2023-08-30 02:44:25,518 INFO L131 PetriNetUnfolder]: For 6803/6803 co-relation queries the response was YES. [2023-08-30 02:44:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57775 conditions, 23194 events. 17095/23194 cut-off events. For 6803/6803 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 123282 event pairs, 3124 based on Foata normal form. 32/23226 useless extension candidates. Maximal degree in co-relation 57767. Up to 13129 conditions per place. [2023-08-30 02:44:25,640 INFO L137 encePairwiseOnDemand]: 270/280 looper letters, 65 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-08-30 02:44:25,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 421 flow [2023-08-30 02:44:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-30 02:44:25,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2023-08-30 02:44:25,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-30 02:44:25,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-30 02:44:25,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:25,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-30 02:44:25,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:25,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:25,646 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:25,646 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 136 flow. Second operand 4 states and 539 transitions. [2023-08-30 02:44:25,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 421 flow [2023-08-30 02:44:25,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 406 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:25,650 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 205 flow [2023-08-30 02:44:25,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-30 02:44:25,651 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-08-30 02:44:25,651 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 205 flow [2023-08-30 02:44:25,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:25,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:25,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:25,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:44:25,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:25,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash 359080817, now seen corresponding path program 1 times [2023-08-30 02:44:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400819851] [2023-08-30 02:44:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:25,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:25,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400819851] [2023-08-30 02:44:25,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400819851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:25,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:25,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:25,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150082995] [2023-08-30 02:44:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:25,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:25,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:25,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:25,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:25,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-30 02:44:25,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:25,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:25,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-30 02:44:25,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:26,469 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][86], [110#P0EXITtrue, Black: 196#(= ~x~0 0), 41#L809true, Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), 158#true, 119#L793true, P1Thread1of1ForFork3InUse, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 64#L3true, P3Thread1of1ForFork0InUse, 126#L826true, 204#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-08-30 02:44:26,469 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:26,470 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:26,470 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:26,470 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:26,891 INFO L130 PetriNetUnfolder]: 10299/15441 cut-off events. [2023-08-30 02:44:26,891 INFO L131 PetriNetUnfolder]: For 8811/9343 co-relation queries the response was YES. [2023-08-30 02:44:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39655 conditions, 15441 events. 10299/15441 cut-off events. For 8811/9343 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 100372 event pairs, 1668 based on Foata normal form. 1493/16549 useless extension candidates. Maximal degree in co-relation 39645. Up to 8985 conditions per place. [2023-08-30 02:44:26,963 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 80 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2023-08-30 02:44:26,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 103 transitions, 606 flow [2023-08-30 02:44:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-30 02:44:26,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-30 02:44:26,966 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-30 02:44:26,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-30 02:44:26,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:26,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-30 02:44:26,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:26,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:26,969 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:26,969 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 205 flow. Second operand 5 states and 672 transitions. [2023-08-30 02:44:26,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 103 transitions, 606 flow [2023-08-30 02:44:26,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 103 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:44:26,979 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 280 flow [2023-08-30 02:44:26,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-30 02:44:26,980 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-30 02:44:26,980 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 280 flow [2023-08-30 02:44:26,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:26,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:26,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:26,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:44:26,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:26,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -423978331, now seen corresponding path program 1 times [2023-08-30 02:44:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366211203] [2023-08-30 02:44:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366211203] [2023-08-30 02:44:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366211203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:27,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667482239] [2023-08-30 02:44:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:27,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:27,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:27,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:27,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-30 02:44:27,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:27,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:27,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-30 02:44:27,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:28,847 INFO L130 PetriNetUnfolder]: 18278/25788 cut-off events. [2023-08-30 02:44:28,848 INFO L131 PetriNetUnfolder]: For 34810/34810 co-relation queries the response was YES. [2023-08-30 02:44:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88698 conditions, 25788 events. 18278/25788 cut-off events. For 34810/34810 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 151094 event pairs, 1001 based on Foata normal form. 192/25980 useless extension candidates. Maximal degree in co-relation 88684. Up to 11323 conditions per place. [2023-08-30 02:44:28,979 INFO L137 encePairwiseOnDemand]: 269/280 looper letters, 87 selfloop transitions, 28 changer transitions 18/133 dead transitions. [2023-08-30 02:44:28,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 133 transitions, 958 flow [2023-08-30 02:44:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 02:44:28,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46714285714285714 [2023-08-30 02:44:28,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 02:44:28,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 02:44:28,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:28,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 02:44:28,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:28,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:28,984 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:28,985 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 280 flow. Second operand 5 states and 654 transitions. [2023-08-30 02:44:28,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 133 transitions, 958 flow [2023-08-30 02:44:29,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 133 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:29,057 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 480 flow [2023-08-30 02:44:29,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-30 02:44:29,058 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-30 02:44:29,058 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 480 flow [2023-08-30 02:44:29,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:29,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:29,058 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 02:44:29,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:44:29,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:29,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1384216794, now seen corresponding path program 1 times [2023-08-30 02:44:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552084793] [2023-08-30 02:44:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:29,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552084793] [2023-08-30 02:44:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552084793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985600668] [2023-08-30 02:44:29,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:29,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-30 02:44:29,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:29,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:29,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-30 02:44:29,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:31,149 INFO L130 PetriNetUnfolder]: 18763/26838 cut-off events. [2023-08-30 02:44:31,149 INFO L131 PetriNetUnfolder]: For 60924/60924 co-relation queries the response was YES. [2023-08-30 02:44:31,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101744 conditions, 26838 events. 18763/26838 cut-off events. For 60924/60924 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 160806 event pairs, 4961 based on Foata normal form. 168/27006 useless extension candidates. Maximal degree in co-relation 101727. Up to 11880 conditions per place. [2023-08-30 02:44:31,283 INFO L137 encePairwiseOnDemand]: 270/280 looper letters, 94 selfloop transitions, 28 changer transitions 3/125 dead transitions. [2023-08-30 02:44:31,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 125 transitions, 1062 flow [2023-08-30 02:44:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-30 02:44:31,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830357142857143 [2023-08-30 02:44:31,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-30 02:44:31,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-30 02:44:31,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:31,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-30 02:44:31,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:31,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:31,288 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:31,288 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 480 flow. Second operand 4 states and 541 transitions. [2023-08-30 02:44:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 125 transitions, 1062 flow [2023-08-30 02:44:31,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 125 transitions, 1056 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:31,704 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 708 flow [2023-08-30 02:44:31,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=708, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-30 02:44:31,705 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-30 02:44:31,705 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 708 flow [2023-08-30 02:44:31,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:31,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:31,705 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 02:44:31,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:44:31,705 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:31,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1343123510, now seen corresponding path program 1 times [2023-08-30 02:44:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249786680] [2023-08-30 02:44:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249786680] [2023-08-30 02:44:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249786680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:31,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890385720] [2023-08-30 02:44:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:31,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:44:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:31,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:44:31,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:44:31,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-30 02:44:31,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 708 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:31,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:31,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-30 02:44:31,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:33,161 INFO L130 PetriNetUnfolder]: 10124/15850 cut-off events. [2023-08-30 02:44:33,161 INFO L131 PetriNetUnfolder]: For 38373/40414 co-relation queries the response was YES. [2023-08-30 02:44:33,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57470 conditions, 15850 events. 10124/15850 cut-off events. For 38373/40414 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 110784 event pairs, 1270 based on Foata normal form. 1951/17520 useless extension candidates. Maximal degree in co-relation 57451. Up to 5617 conditions per place. [2023-08-30 02:44:33,255 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 140 selfloop transitions, 14 changer transitions 2/185 dead transitions. [2023-08-30 02:44:33,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 185 transitions, 1914 flow [2023-08-30 02:44:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-08-30 02:44:33,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48154761904761906 [2023-08-30 02:44:33,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-08-30 02:44:33,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-08-30 02:44:33,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:33,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-08-30 02:44:33,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:33,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:33,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:33,262 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 708 flow. Second operand 6 states and 809 transitions. [2023-08-30 02:44:33,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 185 transitions, 1914 flow [2023-08-30 02:44:33,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 185 transitions, 1890 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-30 02:44:33,301 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 820 flow [2023-08-30 02:44:33,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=820, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2023-08-30 02:44:33,302 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-08-30 02:44:33,302 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 820 flow [2023-08-30 02:44:33,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:33,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:33,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:33,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:44:33,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:33,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1921443718, now seen corresponding path program 1 times [2023-08-30 02:44:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527919586] [2023-08-30 02:44:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527919586] [2023-08-30 02:44:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527919586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:44:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132615546] [2023-08-30 02:44:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:33,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:33,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:44:33,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:33,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:33,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:44:33,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:34,194 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [33#L876-3true, 233#(<= ~__unbuffered_cnt~0 1), Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 66#L786true, 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,195 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:44:34,195 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:34,195 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:34,195 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:44:34,382 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [33#L876-3true, 233#(<= ~__unbuffered_cnt~0 1), Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, 119#L793true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,382 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,382 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,382 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,382 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,387 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 66#L786true, 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,387 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,387 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,387 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,387 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [33#L876-3true, Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 230#true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,600 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, 119#L793true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,600 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,600 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 02:44:34,828 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 230#true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,828 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,828 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 233#(<= ~__unbuffered_cnt~0 1), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 64#L3true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:34,828 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,829 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:44:34,829 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:44:35,048 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_73 256) 0))) (.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_74 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= v_~a~0_30 (ite .cse0 v_~a$w_buff0~0_20 (ite .cse1 v_~a$w_buff1~0_19 v_~a~0_31))) (= v_~a$w_buff0_used~0_73 (ite .cse0 0 v_~a$w_buff0_used~0_74)) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23)) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_65) v_~a$w_buff1_used~0_64) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18))))) InVars {~a~0=v_~a~0_31, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_74, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_30, ~a$w_buff1~0=v_~a$w_buff1~0_19, ~a$w_buff0~0=v_~a$w_buff0~0_20, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_73, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][26], [Black: 196#(= ~x~0 0), 243#(= ~y~0 1), 133#L887true, 158#true, Black: 206#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 203#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 214#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork0InUse, Black: 213#(= ~z~0 1), 126#L826true, Black: 225#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 26#L773true, Black: 222#true, 224#(= ~x~0 1), Black: 165#true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 43#P2EXITtrue, 197#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 236#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 233#(<= ~__unbuffered_cnt~0 1), Black: 173#(<= ~__unbuffered_p2_EAX~0 0), Black: 234#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 116#P1EXITtrue, Black: 182#(= (store |#valid| |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|), 230#true, 216#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))))]) [2023-08-30 02:44:35,048 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:44:35,049 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:35,049 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:35,049 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:35,513 INFO L130 PetriNetUnfolder]: 15203/23820 cut-off events. [2023-08-30 02:44:35,513 INFO L131 PetriNetUnfolder]: For 83040/84748 co-relation queries the response was YES. [2023-08-30 02:44:35,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102003 conditions, 23820 events. 15203/23820 cut-off events. For 83040/84748 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 174696 event pairs, 5127 based on Foata normal form. 516/23742 useless extension candidates. Maximal degree in co-relation 101980. Up to 11713 conditions per place. [2023-08-30 02:44:35,655 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 79 selfloop transitions, 8 changer transitions 12/119 dead transitions. [2023-08-30 02:44:35,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1269 flow [2023-08-30 02:44:35,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-30 02:44:35,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2023-08-30 02:44:35,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-30 02:44:35,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-30 02:44:35,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:35,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-30 02:44:35,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:35,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:35,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:35,659 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 820 flow. Second operand 3 states and 422 transitions. [2023-08-30 02:44:35,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1269 flow [2023-08-30 02:44:37,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1183 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:37,335 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 756 flow [2023-08-30 02:44:37,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-08-30 02:44:37,335 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-08-30 02:44:37,335 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 756 flow [2023-08-30 02:44:37,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:37,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:37,336 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 02:44:37,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:44:37,336 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:37,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1097637608, now seen corresponding path program 1 times [2023-08-30 02:44:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591644075] [2023-08-30 02:44:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:37,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591644075] [2023-08-30 02:44:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591644075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686000367] [2023-08-30 02:44:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:37,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:44:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:37,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:44:37,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:44:37,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-30 02:44:37,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 756 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:37,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:37,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-30 02:44:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:39,538 INFO L130 PetriNetUnfolder]: 11693/18629 cut-off events. [2023-08-30 02:44:39,539 INFO L131 PetriNetUnfolder]: For 49728/51652 co-relation queries the response was YES. [2023-08-30 02:44:39,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70625 conditions, 18629 events. 11693/18629 cut-off events. For 49728/51652 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 138603 event pairs, 1246 based on Foata normal form. 1416/19742 useless extension candidates. Maximal degree in co-relation 70601. Up to 4861 conditions per place. [2023-08-30 02:44:39,612 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 147 selfloop transitions, 23 changer transitions 32/227 dead transitions. [2023-08-30 02:44:39,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 227 transitions, 2394 flow [2023-08-30 02:44:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:44:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:44:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions. [2023-08-30 02:44:39,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2023-08-30 02:44:39,615 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions. [2023-08-30 02:44:39,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions. [2023-08-30 02:44:39,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:39,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions. [2023-08-30 02:44:39,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:39,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:39,619 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:39,619 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 756 flow. Second operand 8 states and 1078 transitions. [2023-08-30 02:44:39,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 227 transitions, 2394 flow [2023-08-30 02:44:40,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 227 transitions, 2336 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:40,463 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 879 flow [2023-08-30 02:44:40,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=879, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-08-30 02:44:40,464 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2023-08-30 02:44:40,464 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 879 flow [2023-08-30 02:44:40,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:40,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:40,465 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] [2023-08-30 02:44:40,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:44:40,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:40,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1746276705, now seen corresponding path program 1 times [2023-08-30 02:44:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111285387] [2023-08-30 02:44:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111285387] [2023-08-30 02:44:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111285387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216836739] [2023-08-30 02:44:40,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:40,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:40,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:40,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 280 [2023-08-30 02:44:40,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 879 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:40,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:40,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 280 [2023-08-30 02:44:40,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:42,512 INFO L130 PetriNetUnfolder]: 11444/18210 cut-off events. [2023-08-30 02:44:42,512 INFO L131 PetriNetUnfolder]: For 53662/55538 co-relation queries the response was YES. [2023-08-30 02:44:42,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75957 conditions, 18210 events. 11444/18210 cut-off events. For 53662/55538 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 135370 event pairs, 1223 based on Foata normal form. 767/18674 useless extension candidates. Maximal degree in co-relation 75931. Up to 4722 conditions per place. [2023-08-30 02:44:42,608 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 85 selfloop transitions, 26 changer transitions 100/223 dead transitions. [2023-08-30 02:44:42,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 223 transitions, 2371 flow [2023-08-30 02:44:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:44:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:44:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1319 transitions. [2023-08-30 02:44:42,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710714285714286 [2023-08-30 02:44:42,610 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1319 transitions. [2023-08-30 02:44:42,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1319 transitions. [2023-08-30 02:44:42,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:42,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1319 transitions. [2023-08-30 02:44:42,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 131.9) internal successors, (1319), 10 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:42,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:42,616 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 280.0) internal successors, (3080), 11 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:42,616 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 879 flow. Second operand 10 states and 1319 transitions. [2023-08-30 02:44:42,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 223 transitions, 2371 flow [2023-08-30 02:44:44,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 223 transitions, 2281 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-08-30 02:44:44,880 INFO L231 Difference]: Finished difference. Result has 90 places, 63 transitions, 555 flow [2023-08-30 02:44:44,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=555, PETRI_PLACES=90, PETRI_TRANSITIONS=63} [2023-08-30 02:44:44,882 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-08-30 02:44:44,882 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 63 transitions, 555 flow [2023-08-30 02:44:44,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:44,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:44,886 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, 1, 1, 1] [2023-08-30 02:44:44,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:44:44,887 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:44,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1593149568, now seen corresponding path program 1 times [2023-08-30 02:44:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134227993] [2023-08-30 02:44:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134227993] [2023-08-30 02:44:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134227993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:45,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312856844] [2023-08-30 02:44:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:45,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:44:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:45,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:44:45,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:44:45,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 280 [2023-08-30 02:44:45,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 63 transitions, 555 flow. Second operand has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:45,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:45,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 280 [2023-08-30 02:44:45,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:46,533 INFO L130 PetriNetUnfolder]: 3176/5065 cut-off events. [2023-08-30 02:44:46,533 INFO L131 PetriNetUnfolder]: For 16537/16537 co-relation queries the response was YES. [2023-08-30 02:44:46,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21381 conditions, 5065 events. 3176/5065 cut-off events. For 16537/16537 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28457 event pairs, 315 based on Foata normal form. 1/5066 useless extension candidates. Maximal degree in co-relation 21353. Up to 2285 conditions per place. [2023-08-30 02:44:46,552 INFO L137 encePairwiseOnDemand]: 266/280 looper letters, 87 selfloop transitions, 17 changer transitions 97/201 dead transitions. [2023-08-30 02:44:46,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 201 transitions, 2002 flow [2023-08-30 02:44:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:44:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:44:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1120 transitions. [2023-08-30 02:44:46,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-30 02:44:46,555 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1120 transitions. [2023-08-30 02:44:46,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1120 transitions. [2023-08-30 02:44:46,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:46,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1120 transitions. [2023-08-30 02:44:46,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.44444444444444) internal successors, (1120), 9 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:46,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:46,560 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:46,560 INFO L175 Difference]: Start difference. First operand has 90 places, 63 transitions, 555 flow. Second operand 9 states and 1120 transitions. [2023-08-30 02:44:46,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 201 transitions, 2002 flow [2023-08-30 02:44:46,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 201 transitions, 1605 flow, removed 66 selfloop flow, removed 17 redundant places. [2023-08-30 02:44:46,632 INFO L231 Difference]: Finished difference. Result has 85 places, 59 transitions, 457 flow [2023-08-30 02:44:46,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=85, PETRI_TRANSITIONS=59} [2023-08-30 02:44:46,633 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-30 02:44:46,633 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 59 transitions, 457 flow [2023-08-30 02:44:46,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:46,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:46,634 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, 1, 1, 1] [2023-08-30 02:44:46,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:44:46,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:46,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1619797892, now seen corresponding path program 2 times [2023-08-30 02:44:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226973096] [2023-08-30 02:44:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226973096] [2023-08-30 02:44:46,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226973096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:46,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:46,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085160876] [2023-08-30 02:44:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:46,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:44:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:44:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:44:46,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-30 02:44:46,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 59 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:46,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:46,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-30 02:44:46,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:47,161 INFO L130 PetriNetUnfolder]: 1574/2536 cut-off events. [2023-08-30 02:44:47,161 INFO L131 PetriNetUnfolder]: For 4885/4885 co-relation queries the response was YES. [2023-08-30 02:44:47,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9552 conditions, 2536 events. 1574/2536 cut-off events. For 4885/4885 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12486 event pairs, 306 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 9527. Up to 986 conditions per place. [2023-08-30 02:44:47,170 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 57 selfloop transitions, 5 changer transitions 52/114 dead transitions. [2023-08-30 02:44:47,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 987 flow [2023-08-30 02:44:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2023-08-30 02:44:47,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2023-08-30 02:44:47,171 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2023-08-30 02:44:47,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2023-08-30 02:44:47,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:47,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2023-08-30 02:44:47,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:47,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:47,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:47,175 INFO L175 Difference]: Start difference. First operand has 85 places, 59 transitions, 457 flow. Second operand 6 states and 755 transitions. [2023-08-30 02:44:47,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 987 flow [2023-08-30 02:44:47,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 931 flow, removed 25 selfloop flow, removed 7 redundant places. [2023-08-30 02:44:47,198 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 264 flow [2023-08-30 02:44:47,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2023-08-30 02:44:47,198 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2023-08-30 02:44:47,198 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 264 flow [2023-08-30 02:44:47,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:47,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:47,199 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, 1, 1, 1] [2023-08-30 02:44:47,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:44:47,199 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:47,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1783181762, now seen corresponding path program 3 times [2023-08-30 02:44:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:47,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868402344] [2023-08-30 02:44:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:47,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868402344] [2023-08-30 02:44:47,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868402344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:47,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:47,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333030409] [2023-08-30 02:44:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:44:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:47,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:44:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:44:47,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-30 02:44:47,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 44 transitions, 264 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:47,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:47,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-30 02:44:47,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:48,132 INFO L130 PetriNetUnfolder]: 851/1469 cut-off events. [2023-08-30 02:44:48,132 INFO L131 PetriNetUnfolder]: For 2505/2652 co-relation queries the response was YES. [2023-08-30 02:44:48,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5362 conditions, 1469 events. 851/1469 cut-off events. For 2505/2652 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7343 event pairs, 23 based on Foata normal form. 18/1468 useless extension candidates. Maximal degree in co-relation 5342. Up to 655 conditions per place. [2023-08-30 02:44:48,138 INFO L137 encePairwiseOnDemand]: 272/280 looper letters, 86 selfloop transitions, 11 changer transitions 42/144 dead transitions. [2023-08-30 02:44:48,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 1060 flow [2023-08-30 02:44:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:44:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:44:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1076 transitions. [2023-08-30 02:44:48,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48035714285714287 [2023-08-30 02:44:48,140 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1076 transitions. [2023-08-30 02:44:48,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1076 transitions. [2023-08-30 02:44:48,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:48,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1076 transitions. [2023-08-30 02:44:48,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:48,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:48,152 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:48,153 INFO L175 Difference]: Start difference. First operand has 77 places, 44 transitions, 264 flow. Second operand 8 states and 1076 transitions. [2023-08-30 02:44:48,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 1060 flow [2023-08-30 02:44:48,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 144 transitions, 995 flow, removed 7 selfloop flow, removed 12 redundant places. [2023-08-30 02:44:48,164 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 300 flow [2023-08-30 02:44:48,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-08-30 02:44:48,165 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2023-08-30 02:44:48,165 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 300 flow [2023-08-30 02:44:48,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:48,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:48,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:48,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:44:48,166 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:48,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash 973784216, now seen corresponding path program 4 times [2023-08-30 02:44:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046886811] [2023-08-30 02:44:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:48,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:44:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:48,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:44:48,325 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:44:48,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:44:48,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:44:48,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:44:48,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:44:48,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:44:48,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:44:48,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:44:48,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:44:48,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:44:48,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:44:48,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:44:48,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:44:48,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:44:48,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:44:48,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:44:48,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:44:48,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:44:48,336 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:48,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:44:48,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:44:48,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:44:48 BasicIcfg [2023-08-30 02:44:48,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:44:48,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:44:48,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:44:48,425 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:44:48,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:05" (3/4) ... [2023-08-30 02:44:48,427 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:44:48,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:44:48,427 INFO L158 Benchmark]: Toolchain (without parser) took 44155.39ms. Allocated memory was 73.4MB in the beginning and 5.5GB in the end (delta: 5.5GB). Free memory was 49.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2023-08-30 02:44:48,428 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:48,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.84ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 45.2MB in the end (delta: 4.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-08-30 02:44:48,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.01ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:48,428 INFO L158 Benchmark]: Boogie Preprocessor took 45.49ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 40.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:48,428 INFO L158 Benchmark]: RCFGBuilder took 624.32ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 47.9MB in the end (delta: -7.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-30 02:44:48,429 INFO L158 Benchmark]: TraceAbstraction took 42997.55ms. Allocated memory was 73.4MB in the beginning and 5.5GB in the end (delta: 5.5GB). Free memory was 47.0MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2023-08-30 02:44:48,429 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 5.5GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:48,430 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.33ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.84ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 45.2MB in the end (delta: 4.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.01ms. Allocated memory is still 73.4MB. Free memory was 45.2MB in the beginning and 42.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.49ms. Allocated memory is still 73.4MB. Free memory was 42.5MB in the beginning and 40.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.32ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 47.9MB in the end (delta: -7.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 42997.55ms. Allocated memory was 73.4MB in the beginning and 5.5GB in the end (delta: 5.5GB). Free memory was 47.0MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 5.5GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 151 PlacesBefore, 54 PlacesAfterwards, 140 TransitionsBefore, 42 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 11356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4368, independent: 4099, independent conditional: 0, independent unconditional: 4099, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1921, independent: 1854, independent conditional: 0, independent unconditional: 1854, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4368, independent: 2245, independent conditional: 0, independent unconditional: 2245, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1921, unknown conditional: 0, unknown unconditional: 1921] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=-3, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=-2, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=-1, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 870]: 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: 874]: 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: 876]: 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, 182 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 998 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3348 IncrementalHoareTripleChecker+Invalid, 3512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 119 mSDtfsCounter, 3348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=879occurred in iteration=13, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 3220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:44:48,453 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/mix008_power.oepc_pso.oepc_rmo.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 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:44:50,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:44:50,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:44:50,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:44:50,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:44:50,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:44:50,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:44:50,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:44:50,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:44:50,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:44:50,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:44:50,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:44:50,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:44:50,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:44:50,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:44:50,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:44:50,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:44:50,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:44:50,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:44:50,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:44:50,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:44:50,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:44:50,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:44:50,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:44:50,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:44:50,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:44:50,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:44:50,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:44:50,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:44:50,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:44:50,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:44:50,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:44:50,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:44:50,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:44:50,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:44:50,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:44:50,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:44:50,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:44:50,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:44:50,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:44:50,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:44:50,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:44:50,552 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:44:50,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:44:50,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:44:50,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:44:50,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:44:50,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:44:50,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:44:50,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:44:50,555 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:44:50,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:44:50,556 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:44:50,557 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:44:50,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:44:50,557 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:44:50,557 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:44:50,557 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:44:50,557 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:44:50,558 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:44:50,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:44:50,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:44:50,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:44:50,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:50,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:44:50,559 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:44:50,560 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:44:50,560 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 -> 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:44:50,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:44:50,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:44:50,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:44:50,853 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:44:50,853 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:44:50,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:44:51,849 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:44:52,079 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:44:52,080 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:44:52,093 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14514bead/ef7301505efc4ed98d817eef35c0f152/FLAG8017e609e [2023-08-30 02:44:52,106 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14514bead/ef7301505efc4ed98d817eef35c0f152 [2023-08-30 02:44:52,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:44:52,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:44:52,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:52,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:44:52,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:44:52,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d51aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52, skipping insertion in model container [2023-08-30 02:44:52,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:44:52,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:44:52,267 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:44:52,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:52,379 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:44:52,386 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 02:44:52,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:52,435 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:52,435 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:52,439 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:44:52,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52 WrapperNode [2023-08-30 02:44:52,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:52,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:52,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:44:52,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:44:52,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,489 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 02:44:52,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:52,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:44:52,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:44:52,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:44:52,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,522 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:44:52,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:44:52,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:44:52,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:44:52,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (1/1) ... [2023-08-30 02:44:52,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:44:52,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:44:52,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:44:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:44:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:44:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:44:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:44:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:44:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:44:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:44:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:44:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:44:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:44:52,605 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:44:52,728 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:44:52,729 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:44:53,030 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:44:53,099 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:44:53,099 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:44:53,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:53 BoogieIcfgContainer [2023-08-30 02:44:53,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:44:53,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:44:53,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:44:53,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:44:53,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:44:52" (1/3) ... [2023-08-30 02:44:53,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4d9c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:53, skipping insertion in model container [2023-08-30 02:44:53,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:52" (2/3) ... [2023-08-30 02:44:53,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4d9c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:53, skipping insertion in model container [2023-08-30 02:44:53,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:53" (3/3) ... [2023-08-30 02:44:53,106 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 02:44:53,117 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:44:53,118 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:44:53,118 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:44:53,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:44:53,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:44:53,257 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:44:53,257 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:53,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:44:53,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-30 02:44:53,270 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:44:53,287 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:44:53,288 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:44:53,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-30 02:44:53,321 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:44:53,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:53,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:53,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-30 02:44:59,445 INFO L134 LiptonReduction]: Checked pairs total: 10907 [2023-08-30 02:44:59,445 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-30 02:44:59,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:44:59,462 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;@2da66dcd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:44:59,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:44:59,465 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:44:59,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:59,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:59,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:44:59,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:59,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2023-08-30 02:44:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:59,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826530982] [2023-08-30 02:44:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:44:59,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:59,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:44:59,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:44:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:59,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:44:59,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:59,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:59,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:59,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826530982] [2023-08-30 02:44:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826530982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:59,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:59,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:44:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641136505] [2023-08-30 02:44:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:59,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:44:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:44:59,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:44:59,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 280 [2023-08-30 02:44:59,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:59,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:59,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 280 [2023-08-30 02:44:59,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:00,880 INFO L130 PetriNetUnfolder]: 8719/11889 cut-off events. [2023-08-30 02:45:00,880 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 02:45:00,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 11889 events. 8719/11889 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 63809 event pairs, 8719 based on Foata normal form. 0/10380 useless extension candidates. Maximal degree in co-relation 23825. Up to 11731 conditions per place. [2023-08-30 02:45:00,935 INFO L137 encePairwiseOnDemand]: 271/280 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-30 02:45:00,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-30 02:45:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:45:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:45:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-30 02:45:00,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5303571428571429 [2023-08-30 02:45:00,945 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-30 02:45:00,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-30 02:45:00,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:00,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-30 02:45:00,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:00,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:00,957 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:00,959 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 297 transitions. [2023-08-30 02:45:00,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-30 02:45:00,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:45:00,964 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-30 02:45:00,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-30 02:45:00,967 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-30 02:45:00,967 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-30 02:45:00,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:00,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:00,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:45:00,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:01,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:01,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 601451, now seen corresponding path program 1 times [2023-08-30 02:45:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348719078] [2023-08-30 02:45:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:01,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:01,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:01,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:45:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:01,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:45:01,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:01,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:01,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348719078] [2023-08-30 02:45:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348719078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:01,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:45:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023774002] [2023-08-30 02:45:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:01,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:45:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:45:01,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:45:01,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 280 [2023-08-30 02:45:01,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:01,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:01,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 280 [2023-08-30 02:45:01,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:02,021 INFO L130 PetriNetUnfolder]: 6855/9366 cut-off events. [2023-08-30 02:45:02,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:45:02,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18803 conditions, 9366 events. 6855/9366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 48333 event pairs, 3527 based on Foata normal form. 0/8703 useless extension candidates. Maximal degree in co-relation 18800. Up to 7399 conditions per place. [2023-08-30 02:45:02,056 INFO L137 encePairwiseOnDemand]: 277/280 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-08-30 02:45:02,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-08-30 02:45:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:45:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:45:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-30 02:45:02,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202380952380953 [2023-08-30 02:45:02,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-30 02:45:02,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-30 02:45:02,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:02,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-30 02:45:02,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,063 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 437 transitions. [2023-08-30 02:45:02,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-08-30 02:45:02,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:45:02,064 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-08-30 02:45:02,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:45:02,065 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-30 02:45:02,065 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-08-30 02:45:02,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:02,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:02,074 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 (3)] Ended with exit code 0 [2023-08-30 02:45:02,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:02,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:02,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:02,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640907, now seen corresponding path program 1 times [2023-08-30 02:45:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:02,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260195087] [2023-08-30 02:45:02,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:02,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:02,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:02,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:02,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:45:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:02,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:45:02,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:02,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:02,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260195087] [2023-08-30 02:45:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260195087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:02,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:02,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:45:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998258437] [2023-08-30 02:45:02,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:02,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:45:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:45:02,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:45:02,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-30 02:45:02,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:02,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-30 02:45:02,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:02,952 INFO L130 PetriNetUnfolder]: 4483/6404 cut-off events. [2023-08-30 02:45:02,952 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-30 02:45:02,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 6404 events. 4483/6404 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 35446 event pairs, 818 based on Foata normal form. 320/6479 useless extension candidates. Maximal degree in co-relation 13349. Up to 4756 conditions per place. [2023-08-30 02:45:02,984 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 40 selfloop transitions, 5 changer transitions 27/77 dead transitions. [2023-08-30 02:45:02,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 322 flow [2023-08-30 02:45:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:45:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:45:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-30 02:45:02,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957142857142857 [2023-08-30 02:45:02,987 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-30 02:45:02,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-30 02:45:02,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:02,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-30 02:45:02,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,991 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,991 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 5 states and 694 transitions. [2023-08-30 02:45:02,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 322 flow [2023-08-30 02:45:02,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:45:02,993 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 115 flow [2023-08-30 02:45:02,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 02:45:02,994 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-30 02:45:02,994 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 115 flow [2023-08-30 02:45:02,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:02,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:02,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:03,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:03,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:03,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:03,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash -670770191, now seen corresponding path program 1 times [2023-08-30 02:45:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348873039] [2023-08-30 02:45:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:03,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 02:45:03,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:03,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:03,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:45:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:03,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:45:03,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:03,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:03,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348873039] [2023-08-30 02:45:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348873039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:03,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:45:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091491259] [2023-08-30 02:45:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:03,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:45:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:03,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:45:03,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:45:03,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-30 02:45:03,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:03,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:03,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-30 02:45:03,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:03,750 INFO L130 PetriNetUnfolder]: 2161/3299 cut-off events. [2023-08-30 02:45:03,750 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2023-08-30 02:45:03,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 3299 events. 2161/3299 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17697 event pairs, 403 based on Foata normal form. 212/3402 useless extension candidates. Maximal degree in co-relation 8687. Up to 1426 conditions per place. [2023-08-30 02:45:03,764 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 53 selfloop transitions, 9 changer transitions 27/94 dead transitions. [2023-08-30 02:45:03,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 471 flow [2023-08-30 02:45:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:45:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:45:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 835 transitions. [2023-08-30 02:45:03,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49702380952380953 [2023-08-30 02:45:03,767 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 835 transitions. [2023-08-30 02:45:03,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 835 transitions. [2023-08-30 02:45:03,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:03,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 835 transitions. [2023-08-30 02:45:03,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.16666666666666) internal successors, (835), 6 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:03,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:03,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:03,772 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 115 flow. Second operand 6 states and 835 transitions. [2023-08-30 02:45:03,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 471 flow [2023-08-30 02:45:03,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 464 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:45:03,784 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 180 flow [2023-08-30 02:45:03,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-30 02:45:03,785 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-30 02:45:03,785 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 180 flow [2023-08-30 02:45:03,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:03,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:03,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:03,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-30 02:45:03,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:03,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:03,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1873097572, now seen corresponding path program 1 times [2023-08-30 02:45:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276848393] [2023-08-30 02:45:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:03,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:04,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:04,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:45:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:04,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:45:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:04,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:04,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:04,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276848393] [2023-08-30 02:45:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276848393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:04,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:45:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292894932] [2023-08-30 02:45:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:04,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:45:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:45:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:45:04,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-30 02:45:04,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:04,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:04,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-30 02:45:04,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:04,552 INFO L130 PetriNetUnfolder]: 1189/1877 cut-off events. [2023-08-30 02:45:04,553 INFO L131 PetriNetUnfolder]: For 1804/1804 co-relation queries the response was YES. [2023-08-30 02:45:04,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 1877 events. 1189/1877 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9391 event pairs, 331 based on Foata normal form. 77/1908 useless extension candidates. Maximal degree in co-relation 5588. Up to 630 conditions per place. [2023-08-30 02:45:04,560 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 64 selfloop transitions, 13 changer transitions 27/109 dead transitions. [2023-08-30 02:45:04,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 109 transitions, 640 flow [2023-08-30 02:45:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:45:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:45:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 974 transitions. [2023-08-30 02:45:04,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969387755102041 [2023-08-30 02:45:04,563 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 974 transitions. [2023-08-30 02:45:04,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 974 transitions. [2023-08-30 02:45:04,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:04,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 974 transitions. [2023-08-30 02:45:04,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.14285714285714) internal successors, (974), 7 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:04,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:04,568 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:04,568 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 180 flow. Second operand 7 states and 974 transitions. [2023-08-30 02:45:04,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 109 transitions, 640 flow [2023-08-30 02:45:04,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 578 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:45:04,579 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 230 flow [2023-08-30 02:45:04,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-30 02:45:04,581 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-30 02:45:04,582 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 230 flow [2023-08-30 02:45:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:04,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:04,582 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] [2023-08-30 02:45:04,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:04,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:04,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:04,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1814509636, now seen corresponding path program 1 times [2023-08-30 02:45:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:04,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786899889] [2023-08-30 02:45:04,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:04,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:04,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:45:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:04,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:45:04,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:04,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:04,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786899889] [2023-08-30 02:45:04,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786899889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:04,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:04,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:45:04,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344497911] [2023-08-30 02:45:04,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:04,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:45:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:45:04,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:45:04,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 280 [2023-08-30 02:45:04,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:04,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:04,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 280 [2023-08-30 02:45:04,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:05,394 INFO L130 PetriNetUnfolder]: 1011/1571 cut-off events. [2023-08-30 02:45:05,395 INFO L131 PetriNetUnfolder]: For 1449/1449 co-relation queries the response was YES. [2023-08-30 02:45:05,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 1571 events. 1011/1571 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7672 event pairs, 326 based on Foata normal form. 14/1552 useless extension candidates. Maximal degree in co-relation 4513. Up to 630 conditions per place. [2023-08-30 02:45:05,407 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 60 selfloop transitions, 17 changer transitions 14/96 dead transitions. [2023-08-30 02:45:05,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 576 flow [2023-08-30 02:45:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:45:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:45:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1085 transitions. [2023-08-30 02:45:05,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2023-08-30 02:45:05,413 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1085 transitions. [2023-08-30 02:45:05,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1085 transitions. [2023-08-30 02:45:05,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:05,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1085 transitions. [2023-08-30 02:45:05,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.625) internal successors, (1085), 8 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:05,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:05,422 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:05,422 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 230 flow. Second operand 8 states and 1085 transitions. [2023-08-30 02:45:05,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 576 flow [2023-08-30 02:45:05,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 514 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:45:05,439 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 224 flow [2023-08-30 02:45:05,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-30 02:45:05,441 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-30 02:45:05,441 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 224 flow [2023-08-30 02:45:05,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:05,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:05,442 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, 1, 1, 1, 1] [2023-08-30 02:45:05,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:05,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:05,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:05,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash 639618804, now seen corresponding path program 1 times [2023-08-30 02:45:05,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268993628] [2023-08-30 02:45:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:05,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:05,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:05,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:05,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:45:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:05,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:45:05,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:06,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:06,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268993628] [2023-08-30 02:45:06,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268993628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:06,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:45:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033701117] [2023-08-30 02:45:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:06,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 02:45:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:06,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 02:45:06,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 02:45:06,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 280 [2023-08-30 02:45:06,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:06,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:06,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 280 [2023-08-30 02:45:06,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:06,631 INFO L130 PetriNetUnfolder]: 1159/1795 cut-off events. [2023-08-30 02:45:06,631 INFO L131 PetriNetUnfolder]: For 1951/1951 co-relation queries the response was YES. [2023-08-30 02:45:06,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5335 conditions, 1795 events. 1159/1795 cut-off events. For 1951/1951 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8772 event pairs, 195 based on Foata normal form. 0/1783 useless extension candidates. Maximal degree in co-relation 5324. Up to 773 conditions per place. [2023-08-30 02:45:06,641 INFO L137 encePairwiseOnDemand]: 273/280 looper letters, 100 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-08-30 02:45:06,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 816 flow [2023-08-30 02:45:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:45:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:45:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1056 transitions. [2023-08-30 02:45:06,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2023-08-30 02:45:06,644 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1056 transitions. [2023-08-30 02:45:06,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1056 transitions. [2023-08-30 02:45:06,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:06,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1056 transitions. [2023-08-30 02:45:06,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:06,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:06,650 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:06,651 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 224 flow. Second operand 8 states and 1056 transitions. [2023-08-30 02:45:06,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 816 flow [2023-08-30 02:45:06,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 660 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-30 02:45:06,663 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 192 flow [2023-08-30 02:45:06,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-30 02:45:06,664 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-08-30 02:45:06,664 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 192 flow [2023-08-30 02:45:06,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:06,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:06,665 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, 1, 1, 1, 1] [2023-08-30 02:45:06,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:06,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:06,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:06,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1789100440, now seen corresponding path program 2 times [2023-08-30 02:45:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751164201] [2023-08-30 02:45:06,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:45:06,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:06,875 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:06,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:45:06,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:45:06,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:45:06,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:45:06,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:07,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:07,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751164201] [2023-08-30 02:45:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751164201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:07,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:07,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:45:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329881528] [2023-08-30 02:45:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:07,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:45:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:45:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:45:07,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:45:07,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:07,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:07,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:45:07,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:07,374 INFO L130 PetriNetUnfolder]: 2066/3234 cut-off events. [2023-08-30 02:45:07,374 INFO L131 PetriNetUnfolder]: For 2545/2545 co-relation queries the response was YES. [2023-08-30 02:45:07,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9202 conditions, 3234 events. 2066/3234 cut-off events. For 2545/2545 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18509 event pairs, 858 based on Foata normal form. 1/3189 useless extension candidates. Maximal degree in co-relation 9191. Up to 1777 conditions per place. [2023-08-30 02:45:07,394 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 75 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-30 02:45:07,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 514 flow [2023-08-30 02:45:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:45:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:45:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-30 02:45:07,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49464285714285716 [2023-08-30 02:45:07,397 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-30 02:45:07,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-30 02:45:07,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:07,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-30 02:45:07,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:07,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:07,401 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:07,401 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 192 flow. Second operand 4 states and 554 transitions. [2023-08-30 02:45:07,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 514 flow [2023-08-30 02:45:07,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 506 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:45:07,441 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 220 flow [2023-08-30 02:45:07,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-30 02:45:07,442 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-30 02:45:07,442 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 220 flow [2023-08-30 02:45:07,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:07,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:07,443 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, 1, 1, 1, 1] [2023-08-30 02:45:07,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:07,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:07,654 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:07,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 908120425, now seen corresponding path program 1 times [2023-08-30 02:45:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461394788] [2023-08-30 02:45:07,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:45:07,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:07,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:07,656 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:07,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:45:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:45:07,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:45:07,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:08,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:08,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461394788] [2023-08-30 02:45:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461394788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:45:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808232849] [2023-08-30 02:45:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:08,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:45:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:45:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:45:08,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-08-30 02:45:08,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:08,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:08,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-08-30 02:45:08,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:08,908 INFO L130 PetriNetUnfolder]: 1816/2885 cut-off events. [2023-08-30 02:45:08,908 INFO L131 PetriNetUnfolder]: For 2413/2413 co-relation queries the response was YES. [2023-08-30 02:45:08,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8445 conditions, 2885 events. 1816/2885 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16480 event pairs, 136 based on Foata normal form. 4/2871 useless extension candidates. Maximal degree in co-relation 8432. Up to 2393 conditions per place. [2023-08-30 02:45:08,916 INFO L137 encePairwiseOnDemand]: 275/280 looper letters, 47 selfloop transitions, 4 changer transitions 20/76 dead transitions. [2023-08-30 02:45:08,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 488 flow [2023-08-30 02:45:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:45:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:45:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2023-08-30 02:45:08,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2023-08-30 02:45:08,919 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2023-08-30 02:45:08,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2023-08-30 02:45:08,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:08,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2023-08-30 02:45:08,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:08,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:08,922 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:08,922 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 220 flow. Second operand 6 states and 704 transitions. [2023-08-30 02:45:08,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 488 flow [2023-08-30 02:45:08,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:45:08,935 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 184 flow [2023-08-30 02:45:08,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2023-08-30 02:45:08,936 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2023-08-30 02:45:08,936 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 184 flow [2023-08-30 02:45:08,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:08,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:08,937 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, 1, 1, 1, 1] [2023-08-30 02:45:08,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:09,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:09,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -610322892, now seen corresponding path program 3 times [2023-08-30 02:45:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030647469] [2023-08-30 02:45:09,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:45:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:09,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:45:09,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:45:09,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:45:09,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:45:09,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:45:09,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:09,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:09,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030647469] [2023-08-30 02:45:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030647469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:09,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:45:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903544887] [2023-08-30 02:45:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:09,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:45:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:45:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:45:09,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-30 02:45:09,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:09,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:09,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-30 02:45:09,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:09,481 INFO L130 PetriNetUnfolder]: 1262/2041 cut-off events. [2023-08-30 02:45:09,481 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2023-08-30 02:45:09,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 2041 events. 1262/2041 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10757 event pairs, 542 based on Foata normal form. 1/2011 useless extension candidates. Maximal degree in co-relation 5940. Up to 1159 conditions per place. [2023-08-30 02:45:09,487 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 54 selfloop transitions, 2 changer transitions 12/72 dead transitions. [2023-08-30 02:45:09,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 462 flow [2023-08-30 02:45:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:45:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:45:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-30 02:45:09,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901785714285714 [2023-08-30 02:45:09,488 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-30 02:45:09,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-30 02:45:09,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:09,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-30 02:45:09,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:09,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:09,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:09,491 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 184 flow. Second operand 4 states and 549 transitions. [2023-08-30 02:45:09,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 462 flow [2023-08-30 02:45:09,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 434 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-30 02:45:09,500 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 175 flow [2023-08-30 02:45:09,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-30 02:45:09,501 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2023-08-30 02:45:09,501 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 175 flow [2023-08-30 02:45:09,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:09,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:09,501 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, 1, 1, 1, 1] [2023-08-30 02:45:09,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:09,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:09,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:09,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2131053730, now seen corresponding path program 4 times [2023-08-30 02:45:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808584199] [2023-08-30 02:45:09,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:45:09,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:09,719 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 02:45:09,720 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 02:45:09,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:45:09,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:45:09,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:45:09,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:45:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:45:09,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:45:09,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:45:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808584199] [2023-08-30 02:45:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808584199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:45:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:45:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:45:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161243988] [2023-08-30 02:45:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:45:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:45:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:45:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:45:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:45:09,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 280 [2023-08-30 02:45:09,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:09,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:45:09,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 280 [2023-08-30 02:45:09,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:45:10,068 INFO L130 PetriNetUnfolder]: 847/1412 cut-off events. [2023-08-30 02:45:10,069 INFO L131 PetriNetUnfolder]: For 1194/1197 co-relation queries the response was YES. [2023-08-30 02:45:10,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 1412 events. 847/1412 cut-off events. For 1194/1197 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6480 event pairs, 316 based on Foata normal form. 1/1399 useless extension candidates. Maximal degree in co-relation 4058. Up to 540 conditions per place. [2023-08-30 02:45:10,072 INFO L137 encePairwiseOnDemand]: 276/280 looper letters, 43 selfloop transitions, 1 changer transitions 34/82 dead transitions. [2023-08-30 02:45:10,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 522 flow [2023-08-30 02:45:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:45:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:45:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-30 02:45:10,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48142857142857143 [2023-08-30 02:45:10,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-30 02:45:10,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-30 02:45:10,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:45:10,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-30 02:45:10,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:10,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:10,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:10,081 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 175 flow. Second operand 5 states and 674 transitions. [2023-08-30 02:45:10,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 522 flow [2023-08-30 02:45:10,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 510 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:45:10,088 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 176 flow [2023-08-30 02:45:10,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-30 02:45:10,089 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-08-30 02:45:10,089 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 176 flow [2023-08-30 02:45:10,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:45:10,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:45:10,089 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, 1, 1, 1, 1] [2023-08-30 02:45:10,101 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 02:45:10,301 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 02:45:10,301 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:45:10,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:45:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1631139888, now seen corresponding path program 5 times [2023-08-30 02:45:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:45:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343087501] [2023-08-30 02:45:10,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:45:10,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:45:10,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:45:10,303 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 02:45:10,304 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 02:45:10,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:45:10,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:45:10,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:45:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:45:10,584 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:45:10,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:45:10,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:45:10,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:45:10,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:45:10,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:45:10,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:45:10,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:45:10,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:45:10,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:45:10,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:45:10,797 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 02:45:10,797 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:45:10,801 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:45:10,801 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:45:10,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:45:10 BasicIcfg [2023-08-30 02:45:10,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:45:10,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:45:10,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:45:10,875 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:45:10,875 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:53" (3/4) ... [2023-08-30 02:45:10,877 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:45:10,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:45:10,877 INFO L158 Benchmark]: Toolchain (without parser) took 18768.64ms. Allocated memory was 75.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 43.5MB in the beginning and 776.8MB in the end (delta: -733.2MB). Peak memory consumption was 584.2MB. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 56.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.17ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 36.2MB in the end (delta: 7.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.14ms. Allocated memory is still 75.5MB. Free memory was 36.2MB in the beginning and 33.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: Boogie Preprocessor took 36.00ms. Allocated memory is still 75.5MB. Free memory was 33.6MB in the beginning and 31.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: RCFGBuilder took 574.40ms. Allocated memory is still 75.5MB. Free memory was 31.4MB in the beginning and 30.3MB in the end (delta: 1.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: TraceAbstraction took 17772.58ms. Allocated memory was 75.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 29.4MB in the beginning and 777.8MB in the end (delta: -748.4MB). Peak memory consumption was 569.0MB. Max. memory is 16.1GB. [2023-08-30 02:45:10,878 INFO L158 Benchmark]: Witness Printer took 2.08ms. Allocated memory is still 1.4GB. Free memory is still 776.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:45:10,879 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.34ms. Allocated memory is still 56.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.17ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 36.2MB in the end (delta: 7.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.14ms. Allocated memory is still 75.5MB. Free memory was 36.2MB in the beginning and 33.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.00ms. Allocated memory is still 75.5MB. Free memory was 33.6MB in the beginning and 31.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.40ms. Allocated memory is still 75.5MB. Free memory was 31.4MB in the beginning and 30.3MB in the end (delta: 1.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17772.58ms. Allocated memory was 75.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 29.4MB in the beginning and 777.8MB in the end (delta: -748.4MB). Peak memory consumption was 569.0MB. Max. memory is 16.1GB. * Witness Printer took 2.08ms. Allocated memory is still 1.4GB. Free memory is still 776.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 152 PlacesBefore, 54 PlacesAfterwards, 141 TransitionsBefore, 42 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 10907 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3709, independent: 3455, independent conditional: 0, independent unconditional: 3455, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1825, independent: 1776, independent conditional: 0, independent unconditional: 1776, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3709, independent: 1679, independent conditional: 0, independent unconditional: 1679, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1825, unknown conditional: 0, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t209, ((void *)0), P0, ((void *)0))=0, t209={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t210, ((void *)0), P1, ((void *)0))=1, t209={11:0}, t210={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t211; [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t211, ((void *)0), P2, ((void *)0))=2, t209={11:0}, t210={15:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t212, ((void *)0), P3, ((void *)0))=3, t209={11:0}, t210={15:0}, t211={7:0}, t212={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L825] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={11:0}, t210={15:0}, t211={7:0}, t212={-2147483637:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 870]: 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: 876]: 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: 874]: 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, 183 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 589 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 490 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2396 IncrementalHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 17 mSDtfsCounter, 2396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 15 QuantifiedInterpolants, 2046 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:45:10,904 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