./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix007.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/mix007.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 87b62b2cd45c104fec3a3f6f97bb4a2e98408c552f26c7f9920866b9b8c9b373 --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:43:40,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:43:40,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:43:40,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:43:40,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:43:40,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:43:40,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:43:40,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:43:40,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:43:40,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:43:40,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:43:40,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:43:40,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:43:40,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:43:40,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:43:40,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:43:40,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:43:40,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:43:40,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:43:40,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:43:40,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:43:40,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:43:40,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:43:40,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:43:40,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:43:40,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:43:40,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:43:40,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:43:40,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:43:40,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:43:40,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:43:40,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:43:40,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:43:40,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:43:40,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:43:40,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:43:40,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:43:40,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:43:40,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:43:40,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:43:40,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:43:40,460 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:43:40,495 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:43:40,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:43:40,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:43:40,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:43:40,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:43:40,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:43:40,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:43:40,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:43:40,499 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:43:40,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:43:40,500 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:43:40,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:43:40,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:43:40,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:43:40,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:43:40,501 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:43:40,501 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:43:40,501 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:43:40,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:43:40,501 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:43:40,502 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:43:40,502 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:43:40,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:43:40,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:43:40,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:43:40,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:43:40,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:43:40,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:43:40,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:43:40,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:43:40,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:43:40,504 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:43:40,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:43:40,504 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:43:40,505 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 -> 87b62b2cd45c104fec3a3f6f97bb4a2e98408c552f26c7f9920866b9b8c9b373 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:43:40,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:43:40,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:43:40,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:43:40,821 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:43:40,821 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:43:40,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-30 02:43:41,916 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:43:42,164 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:43:42,165 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-30 02:43:42,194 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936f260fd/d7f46d7518cc424badea42808de3c84a/FLAG69b46fdbc [2023-08-30 02:43:42,214 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936f260fd/d7f46d7518cc424badea42808de3c84a [2023-08-30 02:43:42,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:43:42,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:43:42,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:43:42,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:43:42,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:43:42,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430c96c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42, skipping insertion in model container [2023-08-30 02:43:42,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:43:42,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:43:42,469 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/mix007.oepc.i[945,958] [2023-08-30 02:43:42,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:43:42,648 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:43:42,662 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/mix007.oepc.i[945,958] [2023-08-30 02:43:42,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:43:42,782 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:43:42,782 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:43:42,788 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:43:42,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42 WrapperNode [2023-08-30 02:43:42,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:43:42,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:43:42,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:43:42,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:43:42,796 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:43:42" (1/1) ... [2023-08-30 02:43:42,819 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:43:42" (1/1) ... [2023-08-30 02:43:42,852 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 02:43:42,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:43:42,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:43:42,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:43:42,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:43:42,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:43:42,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:43:42,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:43:42,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:43:42,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (1/1) ... [2023-08-30 02:43:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:43:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:43:42,939 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:43:42,952 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:43:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:43:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:43:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:43:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:43:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:43:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:43:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:43:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:43:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:43:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:43:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:43:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:43:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:43:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:43:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:43:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:43:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:43:42,984 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:43:43,196 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:43:43,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:43:43,635 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:43:43,739 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:43:43,739 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:43:43,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:43:43 BoogieIcfgContainer [2023-08-30 02:43:43,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:43:43,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:43:43,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:43:43,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:43:43,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:43:42" (1/3) ... [2023-08-30 02:43:43,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f7f597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:43:43, skipping insertion in model container [2023-08-30 02:43:43,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:43:42" (2/3) ... [2023-08-30 02:43:43,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f7f597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:43:43, skipping insertion in model container [2023-08-30 02:43:43,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:43:43" (3/3) ... [2023-08-30 02:43:43,749 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2023-08-30 02:43:43,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:43:43,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:43:43,765 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:43:43,834 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:43:43,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:43:43,944 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:43:43,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:43:43,950 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 111 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:43:43,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:43:43,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-30 02:43:43,963 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:43:43,975 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:43:43,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:43:43,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-30 02:43:44,034 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:43:44,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:43:44,036 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 110 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:43:44,039 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-30 02:43:48,766 INFO L134 LiptonReduction]: Checked pairs total: 10753 [2023-08-30 02:43:48,767 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-30 02:43:48,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:43:48,785 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;@2f6a4d36, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:43:48,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:43:48,787 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:43:48,787 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:43:48,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:48,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:43:48,788 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:43:48,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2023-08-30 02:43:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901037774] [2023-08-30 02:43:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:48,968 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:43:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901037774] [2023-08-30 02:43:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901037774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:48,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:48,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:43:48,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311051111] [2023-08-30 02:43:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:48,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:43:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:43:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:43:49,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 286 [2023-08-30 02:43:49,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 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:43:49,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:49,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 286 [2023-08-30 02:43:49,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:50,412 INFO L130 PetriNetUnfolder]: 7479/10219 cut-off events. [2023-08-30 02:43:50,414 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 02:43:50,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20527 conditions, 10219 events. 7479/10219 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 54225 event pairs, 7479 based on Foata normal form. 0/8770 useless extension candidates. Maximal degree in co-relation 20515. Up to 10091 conditions per place. [2023-08-30 02:43:50,497 INFO L137 encePairwiseOnDemand]: 278/286 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:43:50,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-30 02:43:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:43:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:43:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-30 02:43:50,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157342657342657 [2023-08-30 02:43:50,517 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-30 02:43:50,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-30 02:43:50,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:50,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-30 02:43:50,528 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:43:50,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:50,533 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:50,535 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 295 transitions. [2023-08-30 02:43:50,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-30 02:43:50,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:43:50,543 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:43:50,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:43:50,549 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:43:50,549 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:43:50,551 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:43:50,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:50,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:43:50,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:43:50,554 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:43:50,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash 607220, now seen corresponding path program 1 times [2023-08-30 02:43:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784570778] [2023-08-30 02:43:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:50,825 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:43:50,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784570778] [2023-08-30 02:43:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784570778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:43:50,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276543921] [2023-08-30 02:43:50,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:43:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:43:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:43:50,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2023-08-30 02:43:50,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 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:43:50,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:50,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2023-08-30 02:43:50,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:51,829 INFO L130 PetriNetUnfolder]: 5879/8056 cut-off events. [2023-08-30 02:43:51,830 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:43:51,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16197 conditions, 8056 events. 5879/8056 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 41052 event pairs, 3031 based on Foata normal form. 0/7389 useless extension candidates. Maximal degree in co-relation 16194. Up to 6367 conditions per place. [2023-08-30 02:43:51,881 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-30 02:43:51,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-08-30 02:43:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:43:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:43:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-30 02:43:51,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506993006993007 [2023-08-30 02:43:51,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-30 02:43:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-30 02:43:51,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:51,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-30 02:43:51,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:51,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:51,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:51,892 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 435 transitions. [2023-08-30 02:43:51,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-08-30 02:43:51,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:43:51,893 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:43:51,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:43:51,894 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:43:51,894 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:43:51,894 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:43:51,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:51,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:51,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:43:51,895 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:43:51,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2087289494, now seen corresponding path program 1 times [2023-08-30 02:43:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857784346] [2023-08-30 02:43:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:52,346 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:43:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857784346] [2023-08-30 02:43:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857784346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:43:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057510340] [2023-08-30 02:43:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:52,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:43:52,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:43:52,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:43:52,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-30 02:43:52,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:52,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:52,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-30 02:43:52,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:55,375 INFO L130 PetriNetUnfolder]: 22997/31016 cut-off events. [2023-08-30 02:43:55,376 INFO L131 PetriNetUnfolder]: For 1569/1569 co-relation queries the response was YES. [2023-08-30 02:43:55,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64155 conditions, 31016 events. 22997/31016 cut-off events. For 1569/1569 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 166778 event pairs, 8359 based on Foata normal form. 0/30136 useless extension candidates. Maximal degree in co-relation 64151. Up to 20393 conditions per place. [2023-08-30 02:43:55,576 INFO L137 encePairwiseOnDemand]: 276/286 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2023-08-30 02:43:55,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 248 flow [2023-08-30 02:43:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:43:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:43:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 02:43:55,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801864801864802 [2023-08-30 02:43:55,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 02:43:55,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 02:43:55,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:55,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 02:43:55,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:55,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:55,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:55,583 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 412 transitions. [2023-08-30 02:43:55,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 248 flow [2023-08-30 02:43:55,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:43:55,586 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 138 flow [2023-08-30 02:43:55,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-08-30 02:43:55,588 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2023-08-30 02:43:55,590 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 138 flow [2023-08-30 02:43:55,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:55,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:55,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:55,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:43:55,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:43:55,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2087289503, now seen corresponding path program 1 times [2023-08-30 02:43:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669796058] [2023-08-30 02:43:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:56,221 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:43:56,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669796058] [2023-08-30 02:43:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669796058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:43:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93589607] [2023-08-30 02:43:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:56,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:43:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:43:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:43:56,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 286 [2023-08-30 02:43:56,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:56,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:56,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 286 [2023-08-30 02:43:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:43:58,661 INFO L130 PetriNetUnfolder]: 14780/20916 cut-off events. [2023-08-30 02:43:58,662 INFO L131 PetriNetUnfolder]: For 6445/6572 co-relation queries the response was YES. [2023-08-30 02:43:58,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49451 conditions, 20916 events. 14780/20916 cut-off events. For 6445/6572 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 122599 event pairs, 2599 based on Foata normal form. 518/21099 useless extension candidates. Maximal degree in co-relation 49446. Up to 15165 conditions per place. [2023-08-30 02:43:58,800 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 55 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2023-08-30 02:43:58,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 334 flow [2023-08-30 02:43:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:43:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:43:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-30 02:43:58,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42832167832167833 [2023-08-30 02:43:58,808 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-30 02:43:58,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-30 02:43:58,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:43:58,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-30 02:43:58,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:58,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:58,815 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:58,815 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 138 flow. Second operand 6 states and 735 transitions. [2023-08-30 02:43:58,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 334 flow [2023-08-30 02:43:58,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:43:58,904 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 141 flow [2023-08-30 02:43:58,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 02:43:58,906 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-30 02:43:58,906 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 141 flow [2023-08-30 02:43:58,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:58,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:43:58,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:43:58,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:43:58,907 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:43:58,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:43:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash 88447669, now seen corresponding path program 1 times [2023-08-30 02:43:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:43:58,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190521644] [2023-08-30 02:43:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:43:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:43:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:43:59,362 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:43:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:43:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190521644] [2023-08-30 02:43:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190521644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:43:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:43:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:43:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069639959] [2023-08-30 02:43:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:43:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:43:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:43:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:43:59,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:43:59,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 286 [2023-08-30 02:43:59,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:43:59,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:43:59,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 286 [2023-08-30 02:43:59,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:00,730 INFO L130 PetriNetUnfolder]: 11012/15722 cut-off events. [2023-08-30 02:44:00,730 INFO L131 PetriNetUnfolder]: For 4757/5172 co-relation queries the response was YES. [2023-08-30 02:44:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35755 conditions, 15722 events. 11012/15722 cut-off events. For 4757/5172 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 92622 event pairs, 4380 based on Foata normal form. 387/15426 useless extension candidates. Maximal degree in co-relation 35749. Up to 14407 conditions per place. [2023-08-30 02:44:00,825 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 41 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-08-30 02:44:00,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 261 flow [2023-08-30 02:44:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-30 02:44:00,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131701631701632 [2023-08-30 02:44:00,828 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-30 02:44:00,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-30 02:44:00,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:00,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-30 02:44:00,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:00,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call 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:00,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call 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:00,834 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 141 flow. Second operand 6 states and 709 transitions. [2023-08-30 02:44:00,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 261 flow [2023-08-30 02:44:00,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:44:00,838 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 125 flow [2023-08-30 02:44:00,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-30 02:44:00,839 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-30 02:44:00,839 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 125 flow [2023-08-30 02:44:00,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:00,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:00,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:00,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:44:00,840 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:44:00,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1557179369, now seen corresponding path program 1 times [2023-08-30 02:44:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:00,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568437383] [2023-08-30 02:44:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:01,024 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:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568437383] [2023-08-30 02:44:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568437383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:44:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580758859] [2023-08-30 02:44:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:01,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:01,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-30 02:44:01,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 125 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:01,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:01,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-30 02:44:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:02,307 INFO L130 PetriNetUnfolder]: 10829/15667 cut-off events. [2023-08-30 02:44:02,308 INFO L131 PetriNetUnfolder]: For 3911/4182 co-relation queries the response was YES. [2023-08-30 02:44:02,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35556 conditions, 15667 events. 10829/15667 cut-off events. For 3911/4182 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 93766 event pairs, 3489 based on Foata normal form. 225/15484 useless extension candidates. Maximal degree in co-relation 35550. Up to 9752 conditions per place. [2023-08-30 02:44:02,397 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-08-30 02:44:02,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 250 flow [2023-08-30 02:44:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-30 02:44:02,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49417249417249415 [2023-08-30 02:44:02,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-30 02:44:02,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-30 02:44:02,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:02,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-30 02:44:02,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call 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:02,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call 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:02,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call 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:02,404 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 125 flow. Second operand 3 states and 424 transitions. [2023-08-30 02:44:02,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 250 flow [2023-08-30 02:44:02,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:02,408 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 129 flow [2023-08-30 02:44:02,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-30 02:44:02,411 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2023-08-30 02:44:02,411 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 129 flow [2023-08-30 02:44:02,412 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:02,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:02,412 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:02,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:44:02,412 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:02,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash -733438207, now seen corresponding path program 1 times [2023-08-30 02:44:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560943804] [2023-08-30 02:44:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:02,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:02,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560943804] [2023-08-30 02:44:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560943804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:02,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:02,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172921800] [2023-08-30 02:44:02,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:02,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:02,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:02,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:02,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:02,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-30 02:44:02,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:02,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:02,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-30 02:44:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:04,182 INFO L130 PetriNetUnfolder]: 9059/13526 cut-off events. [2023-08-30 02:44:04,182 INFO L131 PetriNetUnfolder]: For 2786/3163 co-relation queries the response was YES. [2023-08-30 02:44:04,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30574 conditions, 13526 events. 9059/13526 cut-off events. For 2786/3163 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 86712 event pairs, 1813 based on Foata normal form. 1087/14109 useless extension candidates. Maximal degree in co-relation 30567. Up to 5524 conditions per place. [2023-08-30 02:44:04,274 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 57 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2023-08-30 02:44:04,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 353 flow [2023-08-30 02:44:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-30 02:44:04,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48164335664335667 [2023-08-30 02:44:04,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-30 02:44:04,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-30 02:44:04,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:04,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-30 02:44:04,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:04,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call 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:04,285 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call 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:04,286 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 129 flow. Second operand 4 states and 551 transitions. [2023-08-30 02:44:04,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 353 flow [2023-08-30 02:44:04,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:04,293 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 169 flow [2023-08-30 02:44:04,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-30 02:44:04,294 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-30 02:44:04,295 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 169 flow [2023-08-30 02:44:04,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:04,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:04,298 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:04,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:44:04,299 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:04,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2085917366, now seen corresponding path program 1 times [2023-08-30 02:44:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557723660] [2023-08-30 02:44:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:04,529 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:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557723660] [2023-08-30 02:44:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557723660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452934493] [2023-08-30 02:44:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:04,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:04,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:04,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:04,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-30 02:44:04,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:04,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:04,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-30 02:44:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:06,726 INFO L130 PetriNetUnfolder]: 16600/23463 cut-off events. [2023-08-30 02:44:06,726 INFO L131 PetriNetUnfolder]: For 14585/14585 co-relation queries the response was YES. [2023-08-30 02:44:06,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68731 conditions, 23463 events. 16600/23463 cut-off events. For 14585/14585 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 135924 event pairs, 873 based on Foata normal form. 204/23667 useless extension candidates. Maximal degree in co-relation 68722. Up to 10788 conditions per place. [2023-08-30 02:44:06,900 INFO L137 encePairwiseOnDemand]: 276/286 looper letters, 85 selfloop transitions, 18 changer transitions 4/107 dead transitions. [2023-08-30 02:44:06,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 641 flow [2023-08-30 02:44:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-30 02:44:06,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46573426573426574 [2023-08-30 02:44:06,907 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-30 02:44:06,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-30 02:44:06,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:06,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-30 02:44:06,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call 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:06,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call 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:06,915 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call 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:06,915 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 169 flow. Second operand 5 states and 666 transitions. [2023-08-30 02:44:06,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 641 flow [2023-08-30 02:44:06,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 107 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:06,932 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 286 flow [2023-08-30 02:44:06,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-08-30 02:44:06,935 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-30 02:44:06,936 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 286 flow [2023-08-30 02:44:06,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:06,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:06,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:44:06,937 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:06,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1570969018, now seen corresponding path program 1 times [2023-08-30 02:44:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197087993] [2023-08-30 02:44:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:07,221 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:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:07,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197087993] [2023-08-30 02:44:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197087993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:07,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:07,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332087019] [2023-08-30 02:44:07,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:07,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:44:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:07,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:44:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:44:07,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-30 02:44:07,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call 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:07,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:07,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-30 02:44:07,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:08,113 INFO L130 PetriNetUnfolder]: 6148/9757 cut-off events. [2023-08-30 02:44:08,114 INFO L131 PetriNetUnfolder]: For 8626/9068 co-relation queries the response was YES. [2023-08-30 02:44:08,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29257 conditions, 9757 events. 6148/9757 cut-off events. For 8626/9068 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 63789 event pairs, 844 based on Foata normal form. 898/10436 useless extension candidates. Maximal degree in co-relation 29245. Up to 3698 conditions per place. [2023-08-30 02:44:08,161 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 84 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-30 02:44:08,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 112 transitions, 736 flow [2023-08-30 02:44:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-30 02:44:08,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48321678321678324 [2023-08-30 02:44:08,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-30 02:44:08,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-30 02:44:08,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:08,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-30 02:44:08,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:08,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call 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:08,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call 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:08,168 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 286 flow. Second operand 5 states and 691 transitions. [2023-08-30 02:44:08,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 112 transitions, 736 flow [2023-08-30 02:44:08,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 112 transitions, 728 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:08,181 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 345 flow [2023-08-30 02:44:08,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-30 02:44:08,182 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-30 02:44:08,182 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 345 flow [2023-08-30 02:44:08,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call 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:08,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:08,182 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:08,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:44:08,183 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:08,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1735574984, now seen corresponding path program 1 times [2023-08-30 02:44:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663887478] [2023-08-30 02:44:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:08,584 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:08,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:08,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663887478] [2023-08-30 02:44:08,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663887478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:44:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122657339] [2023-08-30 02:44:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:08,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:44:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:44:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:44:08,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 286 [2023-08-30 02:44:08,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 345 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:08,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:08,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 286 [2023-08-30 02:44:08,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:11,044 INFO L130 PetriNetUnfolder]: 20310/29964 cut-off events. [2023-08-30 02:44:11,045 INFO L131 PetriNetUnfolder]: For 60536/60536 co-relation queries the response was YES. [2023-08-30 02:44:11,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111589 conditions, 29964 events. 20310/29964 cut-off events. For 60536/60536 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 194148 event pairs, 4594 based on Foata normal form. 106/30070 useless extension candidates. Maximal degree in co-relation 111575. Up to 10130 conditions per place. [2023-08-30 02:44:11,283 INFO L137 encePairwiseOnDemand]: 270/286 looper letters, 145 selfloop transitions, 70 changer transitions 121/336 dead transitions. [2023-08-30 02:44:11,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 336 transitions, 2682 flow [2023-08-30 02:44:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:44:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:44:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1348 transitions. [2023-08-30 02:44:11,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47132867132867134 [2023-08-30 02:44:11,287 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1348 transitions. [2023-08-30 02:44:11,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1348 transitions. [2023-08-30 02:44:11,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:11,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1348 transitions. [2023-08-30 02:44:11,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call 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,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 286.0) internal successors, (3146), 11 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have call 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,297 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 286.0) internal successors, (3146), 11 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have call 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,297 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 345 flow. Second operand 10 states and 1348 transitions. [2023-08-30 02:44:11,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 336 transitions, 2682 flow [2023-08-30 02:44:11,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 336 transitions, 2587 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:11,390 INFO L231 Difference]: Finished difference. Result has 73 places, 119 transitions, 910 flow [2023-08-30 02:44:11,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=910, PETRI_PLACES=73, PETRI_TRANSITIONS=119} [2023-08-30 02:44:11,390 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-30 02:44:11,391 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 119 transitions, 910 flow [2023-08-30 02:44:11,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:11,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:11,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:11,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:44:11,392 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:11,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 906124812, now seen corresponding path program 1 times [2023-08-30 02:44:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:11,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016277488] [2023-08-30 02:44:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:11,722 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:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016277488] [2023-08-30 02:44:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016277488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239525278] [2023-08-30 02:44:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:11,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:44:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:44:11,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:44:11,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-30 02:44:11,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 119 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:11,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:11,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-30 02:44:11,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:12,978 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][149], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), 87#L878-3true, Black: 203#(= ~z~0 1), Black: 204#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 224#true, 14#L788true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 229#(and (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~a$w_buff0_used~0 1))), 34#L818true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 230#(not (= ~__unbuffered_p0_EAX~0 0)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), Black: 237#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), 85#P0EXITtrue, 31#P3EXITtrue, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 216#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:12,979 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:44:12,979 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:12,979 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:12,979 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:13,046 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][149], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), Black: 203#(= ~z~0 1), Black: 204#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 216#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 224#true, 14#L788true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 159#true, Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 229#(and (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~a$w_buff0_used~0 1))), 34#L818true, 116#L881true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 230#(not (= ~__unbuffered_p0_EAX~0 0)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), Black: 237#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 85#P0EXITtrue, 31#P3EXITtrue, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:13,047 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:44:13,047 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:13,047 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:13,047 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:13,154 INFO L130 PetriNetUnfolder]: 6912/11558 cut-off events. [2023-08-30 02:44:13,154 INFO L131 PetriNetUnfolder]: For 22628/23247 co-relation queries the response was YES. [2023-08-30 02:44:13,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45718 conditions, 11558 events. 6912/11558 cut-off events. For 22628/23247 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 83367 event pairs, 581 based on Foata normal form. 656/11973 useless extension candidates. Maximal degree in co-relation 45698. Up to 3659 conditions per place. [2023-08-30 02:44:13,218 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 195 selfloop transitions, 14 changer transitions 20/268 dead transitions. [2023-08-30 02:44:13,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 268 transitions, 2207 flow [2023-08-30 02:44:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-08-30 02:44:13,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831002331002331 [2023-08-30 02:44:13,221 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-08-30 02:44:13,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-08-30 02:44:13,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:13,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-08-30 02:44:13,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call 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:13,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call 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:13,226 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call 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:13,226 INFO L175 Difference]: Start difference. First operand has 73 places, 119 transitions, 910 flow. Second operand 6 states and 829 transitions. [2023-08-30 02:44:13,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 268 transitions, 2207 flow [2023-08-30 02:44:13,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 268 transitions, 2167 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-30 02:44:13,501 INFO L231 Difference]: Finished difference. Result has 75 places, 121 transitions, 943 flow [2023-08-30 02:44:13,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=75, PETRI_TRANSITIONS=121} [2023-08-30 02:44:13,502 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2023-08-30 02:44:13,502 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 121 transitions, 943 flow [2023-08-30 02:44:13,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:13,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:13,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:13,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:44:13,503 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:13,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2110038503, now seen corresponding path program 1 times [2023-08-30 02:44:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:13,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603374551] [2023-08-30 02:44:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:13,728 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:13,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603374551] [2023-08-30 02:44:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603374551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801106142] [2023-08-30 02:44:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:13,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-30 02:44:13,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 121 transitions, 943 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call 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:13,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:13,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-30 02:44:13,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:15,375 INFO L130 PetriNetUnfolder]: 12685/19616 cut-off events. [2023-08-30 02:44:15,375 INFO L131 PetriNetUnfolder]: For 52446/52446 co-relation queries the response was YES. [2023-08-30 02:44:15,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86191 conditions, 19616 events. 12685/19616 cut-off events. For 52446/52446 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 129364 event pairs, 2699 based on Foata normal form. 15/19631 useless extension candidates. Maximal degree in co-relation 86172. Up to 10859 conditions per place. [2023-08-30 02:44:15,519 INFO L137 encePairwiseOnDemand]: 280/286 looper letters, 120 selfloop transitions, 26 changer transitions 53/199 dead transitions. [2023-08-30 02:44:15,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 199 transitions, 1902 flow [2023-08-30 02:44:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-30 02:44:15,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46940559440559443 [2023-08-30 02:44:15,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-30 02:44:15,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-30 02:44:15,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:15,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-30 02:44:15,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:15,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call 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,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call 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,526 INFO L175 Difference]: Start difference. First operand has 75 places, 121 transitions, 943 flow. Second operand 4 states and 537 transitions. [2023-08-30 02:44:15,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 199 transitions, 1902 flow [2023-08-30 02:44:16,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 199 transitions, 1842 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-30 02:44:16,028 INFO L231 Difference]: Finished difference. Result has 77 places, 106 transitions, 902 flow [2023-08-30 02:44:16,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=902, PETRI_PLACES=77, PETRI_TRANSITIONS=106} [2023-08-30 02:44:16,029 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-30 02:44:16,029 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 902 flow [2023-08-30 02:44:16,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call 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:16,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:16,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:16,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:44:16,030 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:16,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1498184202, now seen corresponding path program 1 times [2023-08-30 02:44:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428742066] [2023-08-30 02:44:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:16,810 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:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428742066] [2023-08-30 02:44:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428742066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:16,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932080724] [2023-08-30 02:44:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:16,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:16,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 286 [2023-08-30 02:44:16,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 902 flow. Second operand has 7 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call 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:16,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:16,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 286 [2023-08-30 02:44:16,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:18,592 INFO L130 PetriNetUnfolder]: 10957/16812 cut-off events. [2023-08-30 02:44:18,593 INFO L131 PetriNetUnfolder]: For 40859/40859 co-relation queries the response was YES. [2023-08-30 02:44:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72774 conditions, 16812 events. 10957/16812 cut-off events. For 40859/40859 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 108195 event pairs, 1244 based on Foata normal form. 11/16823 useless extension candidates. Maximal degree in co-relation 72753. Up to 5862 conditions per place. [2023-08-30 02:44:18,736 INFO L137 encePairwiseOnDemand]: 271/286 looper letters, 207 selfloop transitions, 67 changer transitions 31/305 dead transitions. [2023-08-30 02:44:18,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 305 transitions, 2805 flow [2023-08-30 02:44:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:44:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:44:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1201 transitions. [2023-08-30 02:44:18,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665889665889666 [2023-08-30 02:44:18,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1201 transitions. [2023-08-30 02:44:18,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1201 transitions. [2023-08-30 02:44:18,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:18,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1201 transitions. [2023-08-30 02:44:18,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.44444444444446) internal successors, (1201), 9 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call 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,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call 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,747 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call 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,748 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 902 flow. Second operand 9 states and 1201 transitions. [2023-08-30 02:44:18,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 305 transitions, 2805 flow [2023-08-30 02:44:19,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 305 transitions, 2692 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 02:44:19,235 INFO L231 Difference]: Finished difference. Result has 81 places, 120 transitions, 1195 flow [2023-08-30 02:44:19,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1195, PETRI_PLACES=81, PETRI_TRANSITIONS=120} [2023-08-30 02:44:19,235 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2023-08-30 02:44:19,235 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 120 transitions, 1195 flow [2023-08-30 02:44:19,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call 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:19,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:19,236 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:19,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:44:19,236 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:19,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash 288380656, now seen corresponding path program 2 times [2023-08-30 02:44:19,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:19,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345020365] [2023-08-30 02:44:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345020365] [2023-08-30 02:44:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345020365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353442845] [2023-08-30 02:44:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:19,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:19,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:19,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:19,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 286 [2023-08-30 02:44:19,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 120 transitions, 1195 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:19,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:19,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 286 [2023-08-30 02:44:19,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:22,292 INFO L130 PetriNetUnfolder]: 13582/21230 cut-off events. [2023-08-30 02:44:22,293 INFO L131 PetriNetUnfolder]: For 62999/62999 co-relation queries the response was YES. [2023-08-30 02:44:22,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93714 conditions, 21230 events. 13582/21230 cut-off events. For 62999/62999 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 146614 event pairs, 1531 based on Foata normal form. 9/21239 useless extension candidates. Maximal degree in co-relation 93692. Up to 8042 conditions per place. [2023-08-30 02:44:22,482 INFO L137 encePairwiseOnDemand]: 273/286 looper letters, 180 selfloop transitions, 80 changer transitions 36/296 dead transitions. [2023-08-30 02:44:22,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 296 transitions, 3007 flow [2023-08-30 02:44:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:44:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:44:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1047 transitions. [2023-08-30 02:44:22,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576048951048951 [2023-08-30 02:44:22,485 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1047 transitions. [2023-08-30 02:44:22,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1047 transitions. [2023-08-30 02:44:22,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:22,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1047 transitions. [2023-08-30 02:44:22,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:22,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call 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:22,491 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 286.0) internal successors, (2574), 9 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call 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:22,491 INFO L175 Difference]: Start difference. First operand has 81 places, 120 transitions, 1195 flow. Second operand 8 states and 1047 transitions. [2023-08-30 02:44:22,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 296 transitions, 3007 flow [2023-08-30 02:44:23,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 296 transitions, 2870 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 02:44:23,265 INFO L231 Difference]: Finished difference. Result has 91 places, 147 transitions, 1700 flow [2023-08-30 02:44:23,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1700, PETRI_PLACES=91, PETRI_TRANSITIONS=147} [2023-08-30 02:44:23,266 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2023-08-30 02:44:23,266 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 147 transitions, 1700 flow [2023-08-30 02:44:23,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:23,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:23,267 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:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:44:23,267 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:23,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash -382952574, now seen corresponding path program 3 times [2023-08-30 02:44:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280010518] [2023-08-30 02:44:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:23,637 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,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280010518] [2023-08-30 02:44:23,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280010518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:23,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134658869] [2023-08-30 02:44:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:23,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:23,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:23,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-30 02:44:23,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 147 transitions, 1700 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call 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,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:23,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-30 02:44:23,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:25,044 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][107], [Black: 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), Black: 262#(= ~y~0 1), Black: 263#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 87#L878-3true, 260#true, Black: 203#(= ~z~0 1), 271#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0))), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, 315#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork1InUse, Black: 279#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 285#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 224#true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 297#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 254#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 159#true, Black: 291#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 293#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 295#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 34#L818true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), 35#L795true, 31#P3EXITtrue, 64#L775true, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:25,045 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:44:25,045 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:25,045 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:25,045 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:44:25,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][162], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), Black: 262#(= ~y~0 1), Black: 263#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 87#L878-3true, 260#true, Black: 203#(= ~z~0 1), 271#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0))), 317#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 279#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 285#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 224#true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 297#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 159#true, Black: 291#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 293#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 295#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 34#L818true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), 85#P0EXITtrue, 35#L795true, 31#P3EXITtrue, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:25,148 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,148 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,148 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,148 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,154 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][162], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), Black: 262#(= ~y~0 1), Black: 263#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 87#L878-3true, 260#true, Black: 203#(= ~z~0 1), 271#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0))), 317#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 279#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 285#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 37#P1EXITtrue, 224#true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 297#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 159#true, Black: 291#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 293#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 295#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 34#L818true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), 31#P3EXITtrue, 64#L775true, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:25,154 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,155 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,155 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,155 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:44:25,227 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][279], [319#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), Black: 262#(= ~y~0 1), Black: 263#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 87#L878-3true, 260#true, Black: 203#(= ~z~0 1), 271#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0))), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, 250#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork1InUse, Black: 279#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 285#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 37#P1EXITtrue, 224#true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 297#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 159#true, Black: 291#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 293#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 295#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 34#L818true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), 85#P0EXITtrue, 31#P3EXITtrue, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:25,227 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:44:25,228 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:44:25,228 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:44:25,228 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:44:25,274 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][279], [Black: 256#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 319#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= 0 ~main$tmp_guard0~0)), Black: 262#(= ~y~0 1), Black: 263#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 260#true, Black: 203#(= ~z~0 1), 271#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0))), 185#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 279#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 285#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 37#P1EXITtrue, 224#true, Black: 168#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 297#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 159#true, Black: 291#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 293#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 227#(and (= ~x~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 295#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 233#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 116#L881true, 34#L818true, Black: 226#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t179~0#1.base| 0) |ULTIMATE.start_main_~#t180~0#1.base| 0) |ULTIMATE.start_main_~#t177~0#1.base| 0) |ULTIMATE.start_main_~#t178~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t179~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t178~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|)) (not (= |ULTIMATE.start_main_~#t180~0#1.base| |ULTIMATE.start_main_~#t178~0#1.base|)) (not (= |ULTIMATE.start_main_~#t179~0#1.base| |ULTIMATE.start_main_~#t177~0#1.base|))), 85#P0EXITtrue, 31#P3EXITtrue, 206#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 189#(= ~__unbuffered_p2_EAX~0 0)]) [2023-08-30 02:44:25,275 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:44:25,275 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:44:25,275 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:44:25,275 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:44:25,350 INFO L130 PetriNetUnfolder]: 9230/15476 cut-off events. [2023-08-30 02:44:25,351 INFO L131 PetriNetUnfolder]: For 64606/65609 co-relation queries the response was YES. [2023-08-30 02:44:25,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72502 conditions, 15476 events. 9230/15476 cut-off events. For 64606/65609 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 119480 event pairs, 749 based on Foata normal form. 589/15770 useless extension candidates. Maximal degree in co-relation 72473. Up to 5607 conditions per place. [2023-08-30 02:44:25,473 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 153 selfloop transitions, 18 changer transitions 112/311 dead transitions. [2023-08-30 02:44:25,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 311 transitions, 3914 flow [2023-08-30 02:44:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-30 02:44:25,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469030969030969 [2023-08-30 02:44:25,476 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-30 02:44:25,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-30 02:44:25,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:25,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-30 02:44:25,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call 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,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call 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,482 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call 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,482 INFO L175 Difference]: Start difference. First operand has 91 places, 147 transitions, 1700 flow. Second operand 7 states and 939 transitions. [2023-08-30 02:44:25,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 311 transitions, 3914 flow [2023-08-30 02:44:26,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 311 transitions, 3889 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 02:44:26,561 INFO L231 Difference]: Finished difference. Result has 96 places, 108 transitions, 1144 flow [2023-08-30 02:44:26,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1144, PETRI_PLACES=96, PETRI_TRANSITIONS=108} [2023-08-30 02:44:26,562 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2023-08-30 02:44:26,562 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 108 transitions, 1144 flow [2023-08-30 02:44:26,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call 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,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:26,563 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:26,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:44:26,563 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:26,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1730488001, now seen corresponding path program 1 times [2023-08-30 02:44:26,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669862426] [2023-08-30 02:44:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:26,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:26,857 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:26,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:26,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669862426] [2023-08-30 02:44:26,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669862426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:26,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:26,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:26,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053504486] [2023-08-30 02:44:26,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:26,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:26,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-08-30 02:44:26,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 108 transitions, 1144 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call 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,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:26,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-08-30 02:44:26,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:27,743 INFO L130 PetriNetUnfolder]: 4757/8064 cut-off events. [2023-08-30 02:44:27,743 INFO L131 PetriNetUnfolder]: For 33402/33851 co-relation queries the response was YES. [2023-08-30 02:44:27,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39971 conditions, 8064 events. 4757/8064 cut-off events. For 33402/33851 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 54552 event pairs, 1029 based on Foata normal form. 30/7976 useless extension candidates. Maximal degree in co-relation 39942. Up to 4047 conditions per place. [2023-08-30 02:44:27,789 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 63 selfloop transitions, 1 changer transitions 107/182 dead transitions. [2023-08-30 02:44:27,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 2117 flow [2023-08-30 02:44:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-30 02:44:27,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2023-08-30 02:44:27,791 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-30 02:44:27,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-30 02:44:27,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:27,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-30 02:44:27,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call 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,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call 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,795 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call 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,795 INFO L175 Difference]: Start difference. First operand has 96 places, 108 transitions, 1144 flow. Second operand 4 states and 559 transitions. [2023-08-30 02:44:27,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 2117 flow [2023-08-30 02:44:28,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 182 transitions, 1924 flow, removed 34 selfloop flow, removed 9 redundant places. [2023-08-30 02:44:28,051 INFO L231 Difference]: Finished difference. Result has 90 places, 69 transitions, 583 flow [2023-08-30 02:44:28,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=583, PETRI_PLACES=90, PETRI_TRANSITIONS=69} [2023-08-30 02:44:28,051 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2023-08-30 02:44:28,051 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 69 transitions, 583 flow [2023-08-30 02:44:28,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call 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,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:28,052 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:28,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:44:28,052 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:28,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1775318113, now seen corresponding path program 2 times [2023-08-30 02:44:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771916309] [2023-08-30 02:44:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:28,318 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:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:28,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771916309] [2023-08-30 02:44:28,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771916309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:28,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:28,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631337961] [2023-08-30 02:44:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:28,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:44:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:44:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:44:28,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-30 02:44:28,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 69 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:28,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:28,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-30 02:44:28,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:28,747 INFO L130 PetriNetUnfolder]: 2029/3303 cut-off events. [2023-08-30 02:44:28,747 INFO L131 PetriNetUnfolder]: For 8063/8063 co-relation queries the response was YES. [2023-08-30 02:44:28,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14470 conditions, 3303 events. 2029/3303 cut-off events. For 8063/8063 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17512 event pairs, 344 based on Foata normal form. 1/3304 useless extension candidates. Maximal degree in co-relation 14444. Up to 1267 conditions per place. [2023-08-30 02:44:28,761 INFO L137 encePairwiseOnDemand]: 278/286 looper letters, 71 selfloop transitions, 6 changer transitions 69/146 dead transitions. [2023-08-30 02:44:28,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 146 transitions, 1376 flow [2023-08-30 02:44:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-08-30 02:44:28,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45046620046620045 [2023-08-30 02:44:28,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-08-30 02:44:28,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-08-30 02:44:28,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:28,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-08-30 02:44:28,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call 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,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call 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,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call 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,768 INFO L175 Difference]: Start difference. First operand has 90 places, 69 transitions, 583 flow. Second operand 6 states and 773 transitions. [2023-08-30 02:44:28,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 146 transitions, 1376 flow [2023-08-30 02:44:28,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 146 transitions, 1171 flow, removed 13 selfloop flow, removed 15 redundant places. [2023-08-30 02:44:28,799 INFO L231 Difference]: Finished difference. Result has 80 places, 51 transitions, 307 flow [2023-08-30 02:44:28,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=80, PETRI_TRANSITIONS=51} [2023-08-30 02:44:28,800 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2023-08-30 02:44:28,800 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 51 transitions, 307 flow [2023-08-30 02:44:28,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:28,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:28,801 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:28,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:44:28,802 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:28,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1049553513, now seen corresponding path program 3 times [2023-08-30 02:44:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360323829] [2023-08-30 02:44:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:29,658 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,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:44:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360323829] [2023-08-30 02:44:29,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360323829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:29,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:29,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:29,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734560736] [2023-08-30 02:44:29,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:29,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:44:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:44:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:44:29,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:44:29,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2023-08-30 02:44:29,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 51 transitions, 307 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call 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,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:29,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2023-08-30 02:44:29,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:29,962 INFO L130 PetriNetUnfolder]: 680/1230 cut-off events. [2023-08-30 02:44:29,962 INFO L131 PetriNetUnfolder]: For 1947/1991 co-relation queries the response was YES. [2023-08-30 02:44:29,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 1230 events. 680/1230 cut-off events. For 1947/1991 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6002 event pairs, 80 based on Foata normal form. 1/1227 useless extension candidates. Maximal degree in co-relation 4519. Up to 491 conditions per place. [2023-08-30 02:44:29,967 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 82 selfloop transitions, 7 changer transitions 25/119 dead transitions. [2023-08-30 02:44:29,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 119 transitions, 886 flow [2023-08-30 02:44:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-30 02:44:29,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469030969030969 [2023-08-30 02:44:29,969 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-30 02:44:29,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-30 02:44:29,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:29,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-30 02:44:29,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call 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,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call 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,974 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call 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,974 INFO L175 Difference]: Start difference. First operand has 80 places, 51 transitions, 307 flow. Second operand 7 states and 939 transitions. [2023-08-30 02:44:29,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 119 transitions, 886 flow [2023-08-30 02:44:29,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 119 transitions, 745 flow, removed 22 selfloop flow, removed 14 redundant places. [2023-08-30 02:44:29,982 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 268 flow [2023-08-30 02:44:29,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-30 02:44:29,982 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2023-08-30 02:44:29,983 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 268 flow [2023-08-30 02:44:29,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call 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,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:29,983 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:29,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:44:29,984 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1256927849, now seen corresponding path program 4 times [2023-08-30 02:44:29,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:44:29,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203694318] [2023-08-30 02:44:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:44:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:30,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:44:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:30,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:44:30,111 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:44:30,112 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:44:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:44:30,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:44:30,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:44:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:44:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:44:30,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:44:30,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:44:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:44:30,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:44:30,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:44:30,119 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:30,124 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:44:30,124 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:44:30,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:44:30 BasicIcfg [2023-08-30 02:44:30,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:44:30,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:44:30,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:44:30,226 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:44:30,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:43:43" (3/4) ... [2023-08-30 02:44:30,228 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:44:30,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:44:30,229 INFO L158 Benchmark]: Toolchain (without parser) took 48010.44ms. Allocated memory was 73.4MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 40.6MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2023-08-30 02:44:30,229 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory is still 32.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:30,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.01ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 33.8MB in the end (delta: 6.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-08-30 02:44:30,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.96ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 31.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:30,230 INFO L158 Benchmark]: Boogie Preprocessor took 52.05ms. Allocated memory is still 73.4MB. Free memory was 31.5MB in the beginning and 51.1MB in the end (delta: -19.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:44:30,230 INFO L158 Benchmark]: RCFGBuilder took 835.59ms. Allocated memory is still 73.4MB. Free memory was 50.8MB in the beginning and 30.9MB in the end (delta: 19.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-08-30 02:44:30,230 INFO L158 Benchmark]: TraceAbstraction took 46481.76ms. Allocated memory was 73.4MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 30.1MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2023-08-30 02:44:30,231 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 5.7GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:30,232 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.20ms. Allocated memory is still 54.5MB. Free memory is still 32.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.01ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 33.8MB in the end (delta: 6.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.96ms. Allocated memory is still 73.4MB. Free memory was 33.8MB in the beginning and 31.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.05ms. Allocated memory is still 73.4MB. Free memory was 31.5MB in the beginning and 51.1MB in the end (delta: -19.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 835.59ms. Allocated memory is still 73.4MB. Free memory was 50.8MB in the beginning and 30.9MB in the end (delta: 19.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 46481.76ms. Allocated memory was 73.4MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 30.1MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 5.7GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 152 PlacesBefore, 53 PlacesAfterwards, 141 TransitionsBefore, 40 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 10753 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4480, independent: 4226, independent conditional: 0, independent unconditional: 4226, 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: 1923, independent: 1865, independent conditional: 0, independent unconditional: 1865, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4480, independent: 2361, independent conditional: 0, independent unconditional: 2361, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1923, unknown conditional: 0, unknown unconditional: 1923] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t177, ((void *)0), P0, ((void *)0))=-3, t177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t178, ((void *)0), P1, ((void *)0))=-2, t177={5:0}, t178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t179, ((void *)0), P2, ((void *)0))=-1, t177={5:0}, t178={6:0}, t179={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t180, ((void *)0), P3, ((void *)0))=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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_p0_EAX=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=1, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=0] [L827] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 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) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, x=1, y=2, z=1] [L849] 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) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 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 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, x=1, y=2, z=1] [L813] 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) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 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 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 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_p0_EAX=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=1, x=1, y=2, z=1] [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 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 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 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_p0_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_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=1, x=1, 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: 869]: 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: 878]: 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: 46.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1433 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1231 mSDsluCounter, 489 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 391 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3442 IncrementalHoareTripleChecker+Invalid, 3638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 98 mSDtfsCounter, 3442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1700occurred in iteration=14, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 3237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:30,260 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/mix007.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 87b62b2cd45c104fec3a3f6f97bb4a2e98408c552f26c7f9920866b9b8c9b373 --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:32,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:44:32,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:44:32,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:44:32,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:44:32,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:44:32,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:44:32,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:44:32,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:44:32,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:44:32,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:44:32,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:44:32,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:44:32,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:44:32,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:44:32,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:44:32,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:44:32,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:44:32,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:44:32,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:44:32,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:44:32,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:44:32,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:44:32,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:44:32,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:44:32,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:44:32,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:44:32,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:44:32,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:44:32,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:44:32,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:44:32,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:44:32,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:44:32,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:44:32,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:44:32,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:44:32,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:44:32,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:44:32,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:44:32,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:44:32,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:44:32,688 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:32,728 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:44:32,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:44:32,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:44:32,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:44:32,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:44:32,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:44:32,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:44:32,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:44:32,732 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:44:32,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:44:32,733 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:44:32,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:44:32,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:44:32,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:44:32,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:44:32,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:44:32,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:44:32,734 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:44:32,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:44:32,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:44:32,735 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:44:32,735 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:44:32,735 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:44:32,735 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:44:32,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:44:32,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:44:32,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:44:32,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:32,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:44:32,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:44:32,737 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:44:32,737 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:44:32,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:44:32,738 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:44:32,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:44:32,738 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:44:32,738 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:44:32,738 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 -> 87b62b2cd45c104fec3a3f6f97bb4a2e98408c552f26c7f9920866b9b8c9b373 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:33,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:44:33,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:44:33,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:44:33,120 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:44:33,120 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:44:33,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-30 02:44:34,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:44:34,542 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:44:34,543 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-30 02:44:34,557 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6620b1792/c556ab4192014d82bca8bc82b8161238/FLAG967e01bb7 [2023-08-30 02:44:34,579 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6620b1792/c556ab4192014d82bca8bc82b8161238 [2023-08-30 02:44:34,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:44:34,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:44:34,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:34,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:44:34,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:44:34,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:34" (1/1) ... [2023-08-30 02:44:34,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313dcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:34, skipping insertion in model container [2023-08-30 02:44:34,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:44:34" (1/1) ... [2023-08-30 02:44:34,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:44:34,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:44:34,833 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/mix007.oepc.i[945,958] [2023-08-30 02:44:35,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:35,061 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:44:35,073 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/mix007.oepc.i[945,958] [2023-08-30 02:44:35,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:44:35,160 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:35,160 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:44:35,166 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:44:35,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:35 WrapperNode [2023-08-30 02:44:35,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:44:35,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:35,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:44:35,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:44:35,174 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:35" (1/1) ... [2023-08-30 02:44:35,190 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:35" (1/1) ... [2023-08-30 02:44:35,212 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-30 02:44:35,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:44:35,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:44:35,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:44:35,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:44:35,225 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:35" (1/1) ... [2023-08-30 02:44:35,226 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:35" (1/1) ... [2023-08-30 02:44:35,234 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:35" (1/1) ... [2023-08-30 02:44:35,235 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:35" (1/1) ... [2023-08-30 02:44:35,253 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:35" (1/1) ... [2023-08-30 02:44:35,255 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:35" (1/1) ... [2023-08-30 02:44:35,258 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:35" (1/1) ... [2023-08-30 02:44:35,259 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:35" (1/1) ... [2023-08-30 02:44:35,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:44:35,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:44:35,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:44:35,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:44:35,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:35" (1/1) ... [2023-08-30 02:44:35,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:44:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:44:35,293 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:35,323 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:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:44:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:44:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:44:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:44:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:44:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:44:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:44:35,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:44:35,337 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:44:35,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:44:35,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:44:35,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:44:35,338 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:44:35,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:44:35,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:44:35,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:44:35,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:44:35,340 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:35,562 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:44:35,564 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:44:35,940 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:44:36,071 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:44:36,071 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:44:36,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:36 BoogieIcfgContainer [2023-08-30 02:44:36,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:44:36,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:44:36,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:44:36,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:44:36,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:44:34" (1/3) ... [2023-08-30 02:44:36,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf47269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:36, skipping insertion in model container [2023-08-30 02:44:36,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:44:35" (2/3) ... [2023-08-30 02:44:36,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf47269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:44:36, skipping insertion in model container [2023-08-30 02:44:36,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:44:36" (3/3) ... [2023-08-30 02:44:36,082 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2023-08-30 02:44:36,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:44:36,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:44:36,099 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:44:36,183 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:44:36,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 02:44:36,298 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 02:44:36,298 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:36,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:36,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 02:44:36,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:36,316 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:44:36,328 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:36,332 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:36,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-30 02:44:36,383 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 02:44:36,383 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:36,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:44:36,388 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-30 02:44:44,017 INFO L134 LiptonReduction]: Checked pairs total: 10768 [2023-08-30 02:44:44,017 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-30 02:44:44,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:44:44,035 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;@317fab9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:44:44,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:44:44,037 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:44:44,037 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:44,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:44,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:44:44,038 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:44,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2023-08-30 02:44:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039197655] [2023-08-30 02:44:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:44,053 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:44,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:44,056 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:44,059 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:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:44,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:44:44,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:44,136 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:44,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:44,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039197655] [2023-08-30 02:44:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039197655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:44:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392227838] [2023-08-30 02:44:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:44,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:44:44,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:44,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:44:44,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:44:44,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 282 [2023-08-30 02:44:44,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:44,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:44,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 282 [2023-08-30 02:44:44,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:45,610 INFO L130 PetriNetUnfolder]: 7479/10219 cut-off events. [2023-08-30 02:44:45,610 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 02:44:45,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20527 conditions, 10219 events. 7479/10219 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 54132 event pairs, 7479 based on Foata normal form. 0/8770 useless extension candidates. Maximal degree in co-relation 20515. Up to 10091 conditions per place. [2023-08-30 02:44:45,681 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-30 02:44:45,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-30 02:44:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:44:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:44:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-30 02:44:45,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2023-08-30 02:44:45,696 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-30 02:44:45,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-30 02:44:45,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:45,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-30 02:44:45,703 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:44:45,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call 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,707 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call 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,709 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 297 transitions. [2023-08-30 02:44:45,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-30 02:44:45,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:45,716 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-30 02:44:45,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-30 02:44:45,721 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-30 02:44:45,722 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-30 02:44:45,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:45,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:45,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:44:45,731 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:44:45,931 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:44:45,932 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:45,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 605362, now seen corresponding path program 1 times [2023-08-30 02:44:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640230308] [2023-08-30 02:44:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:45,934 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:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:45,936 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:44:45,939 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:44:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:46,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:44:46,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:46,079 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,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:46,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640230308] [2023-08-30 02:44:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640230308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:44:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386162893] [2023-08-30 02:44:46,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:46,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:46,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 282 [2023-08-30 02:44:46,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 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:46,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:46,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 282 [2023-08-30 02:44:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:47,264 INFO L130 PetriNetUnfolder]: 5879/8516 cut-off events. [2023-08-30 02:44:47,266 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:44:47,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16657 conditions, 8516 events. 5879/8516 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 52833 event pairs, 1079 based on Foata normal form. 0/7846 useless extension candidates. Maximal degree in co-relation 16654. Up to 6367 conditions per place. [2023-08-30 02:44:47,320 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-30 02:44:47,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-08-30 02:44:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-30 02:44:47,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2023-08-30 02:44:47,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-30 02:44:47,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-30 02:44:47,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:47,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-30 02:44:47,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call 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,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call 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,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call 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,331 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 438 transitions. [2023-08-30 02:44:47,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-08-30 02:44:47,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:44:47,333 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-30 02:44:47,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 02:44:47,334 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-30 02:44:47,334 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-30 02:44:47,335 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:47,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:47,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:47,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:47,544 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:44:47,545 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:47,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash 905946260, now seen corresponding path program 1 times [2023-08-30 02:44:47,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:47,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543079573] [2023-08-30 02:44:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:47,547 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:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:47,548 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:44:47,551 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:44:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:47,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:44:47,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:47,703 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,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:47,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543079573] [2023-08-30 02:44:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543079573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:47,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289274797] [2023-08-30 02:44:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:47,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:47,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-30 02:44:47,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call 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,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:47,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-30 02:44:47,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:48,545 INFO L130 PetriNetUnfolder]: 3939/5667 cut-off events. [2023-08-30 02:44:48,546 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-30 02:44:48,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11816 conditions, 5667 events. 3939/5667 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 31581 event pairs, 655 based on Foata normal form. 320/5704 useless extension candidates. Maximal degree in co-relation 11812. Up to 3025 conditions per place. [2023-08-30 02:44:48,568 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 51 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2023-08-30 02:44:48,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 264 flow [2023-08-30 02:44:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-30 02:44:48,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929078014184397 [2023-08-30 02:44:48,571 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-30 02:44:48,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-30 02:44:48,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:48,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-30 02:44:48,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:48,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call 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,577 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call 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,578 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 556 transitions. [2023-08-30 02:44:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 264 flow [2023-08-30 02:44:48,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:48,580 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 110 flow [2023-08-30 02:44:48,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-30 02:44:48,582 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-08-30 02:44:48,582 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 110 flow [2023-08-30 02:44:48,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call 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,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:48,583 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:48,592 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 (4)] Ended with exit code 0 [2023-08-30 02:44:48,792 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:44:48,793 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:48,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2136442944, now seen corresponding path program 1 times [2023-08-30 02:44:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:48,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431569969] [2023-08-30 02:44:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:48,794 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:48,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:48,795 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:44:48,804 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:44:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:48,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:44:48,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:48,985 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:48,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:48,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:48,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431569969] [2023-08-30 02:44:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431569969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:48,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649709602] [2023-08-30 02:44:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:48,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:44:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:48,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:44:48,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:44:49,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-30 02:44:49,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:49,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:49,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-30 02:44:49,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:49,455 INFO L130 PetriNetUnfolder]: 2022/3101 cut-off events. [2023-08-30 02:44:49,455 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2023-08-30 02:44:49,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7849 conditions, 3101 events. 2022/3101 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16803 event pairs, 328 based on Foata normal form. 212/3203 useless extension candidates. Maximal degree in co-relation 7843. Up to 1044 conditions per place. [2023-08-30 02:44:49,475 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 64 selfloop transitions, 10 changer transitions 1/80 dead transitions. [2023-08-30 02:44:49,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 381 flow [2023-08-30 02:44:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:44:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:44:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-30 02:44:49,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49432624113475176 [2023-08-30 02:44:49,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-30 02:44:49,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-30 02:44:49,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:49,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-30 02:44:49,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call 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:49,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call 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:49,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call 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:49,484 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 110 flow. Second operand 5 states and 697 transitions. [2023-08-30 02:44:49,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 381 flow [2023-08-30 02:44:49,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 370 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:44:49,493 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 162 flow [2023-08-30 02:44:49,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-30 02:44:49,494 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-30 02:44:49,494 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 162 flow [2023-08-30 02:44:49,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:49,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:49,495 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:49,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:49,708 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:44:49,708 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:44:49,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -993834977, now seen corresponding path program 1 times [2023-08-30 02:44:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143081505] [2023-08-30 02:44:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:49,709 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:49,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:49,710 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:44:49,716 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:44:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:49,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:44:49,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:49,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:49,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143081505] [2023-08-30 02:44:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143081505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:49,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:49,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:44:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46345343] [2023-08-30 02:44:49,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:49,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:44:49,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:49,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:44:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:44:49,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-30 02:44:49,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call 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:49,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:49,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-30 02:44:49,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:50,402 INFO L130 PetriNetUnfolder]: 1176/1868 cut-off events. [2023-08-30 02:44:50,402 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2023-08-30 02:44:50,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 1868 events. 1176/1868 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9471 event pairs, 326 based on Foata normal form. 77/1898 useless extension candidates. Maximal degree in co-relation 5357. Up to 630 conditions per place. [2023-08-30 02:44:50,412 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 75 selfloop transitions, 14 changer transitions 1/95 dead transitions. [2023-08-30 02:44:50,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 504 flow [2023-08-30 02:44:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-30 02:44:50,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940898345153664 [2023-08-30 02:44:50,418 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-30 02:44:50,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-30 02:44:50,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:50,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-30 02:44:50,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call 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:50,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call 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:50,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call 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:50,425 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 162 flow. Second operand 6 states and 836 transitions. [2023-08-30 02:44:50,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 504 flow [2023-08-30 02:44:50,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 474 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:44:50,437 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 212 flow [2023-08-30 02:44:50,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-30 02:44:50,439 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-30 02:44:50,439 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 212 flow [2023-08-30 02:44:50,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call 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:50,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:50,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] [2023-08-30 02:44:50,457 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:44:50,653 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:44:50,654 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:44:50,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash -297625320, now seen corresponding path program 1 times [2023-08-30 02:44:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:50,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43582914] [2023-08-30 02:44:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:50,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:44:50,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:50,656 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:44:50,658 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:44:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:50,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:44:50,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:44:50,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:50,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43582914] [2023-08-30 02:44:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43582914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:50,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201197893] [2023-08-30 02:44:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:44:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:44:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:44:50,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-30 02:44:50,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call 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:50,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:50,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-30 02:44:50,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:51,299 INFO L130 PetriNetUnfolder]: 1011/1588 cut-off events. [2023-08-30 02:44:51,299 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-30 02:44:51,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1588 events. 1011/1588 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7865 event pairs, 326 based on Foata normal form. 14/1568 useless extension candidates. Maximal degree in co-relation 4621. Up to 630 conditions per place. [2023-08-30 02:44:51,309 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 58 selfloop transitions, 18 changer transitions 1/82 dead transitions. [2023-08-30 02:44:51,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 462 flow [2023-08-30 02:44:51,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-30 02:44:51,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797365754812563 [2023-08-30 02:44:51,313 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-30 02:44:51,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-30 02:44:51,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:51,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-30 02:44:51,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call 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:51,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call 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:51,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call 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:51,318 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 212 flow. Second operand 7 states and 947 transitions. [2023-08-30 02:44:51,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 462 flow [2023-08-30 02:44:51,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 416 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-30 02:44:51,331 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2023-08-30 02:44:51,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-30 02:44:51,332 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-30 02:44:51,332 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 222 flow [2023-08-30 02:44:51,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call 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:51,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:51,332 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:51,342 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:44:51,536 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:44:51,537 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:51,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2142166973, now seen corresponding path program 1 times [2023-08-30 02:44:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302655318] [2023-08-30 02:44:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:51,538 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:51,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:51,539 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:44:51,540 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:44:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:51,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:44:51,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:52,129 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:52,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:52,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:52,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302655318] [2023-08-30 02:44:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302655318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:52,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:44:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944450145] [2023-08-30 02:44:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:52,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:44:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:44:52,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:44:52,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 282 [2023-08-30 02:44:52,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call 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:52,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:52,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 282 [2023-08-30 02:44:52,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:52,621 INFO L130 PetriNetUnfolder]: 1159/1899 cut-off events. [2023-08-30 02:44:52,621 INFO L131 PetriNetUnfolder]: For 2145/2145 co-relation queries the response was YES. [2023-08-30 02:44:52,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1899 events. 1159/1899 cut-off events. For 2145/2145 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10408 event pairs, 145 based on Foata normal form. 0/1883 useless extension candidates. Maximal degree in co-relation 5490. Up to 773 conditions per place. [2023-08-30 02:44:52,632 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 99 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2023-08-30 02:44:52,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 814 flow [2023-08-30 02:44:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:44:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:44:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 945 transitions. [2023-08-30 02:44:52,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2023-08-30 02:44:52,636 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 945 transitions. [2023-08-30 02:44:52,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 945 transitions. [2023-08-30 02:44:52,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:52,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 945 transitions. [2023-08-30 02:44:52,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call 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:52,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call 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:52,642 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call 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:52,642 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 222 flow. Second operand 7 states and 945 transitions. [2023-08-30 02:44:52,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 814 flow [2023-08-30 02:44:52,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 548 flow, removed 34 selfloop flow, removed 11 redundant places. [2023-08-30 02:44:52,652 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 148 flow [2023-08-30 02:44:52,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-30 02:44:52,653 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-30 02:44:52,654 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 148 flow [2023-08-30 02:44:52,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call 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:52,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:52,654 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:52,665 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:44:52,865 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:44:52,865 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:52,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 99907773, now seen corresponding path program 2 times [2023-08-30 02:44:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:52,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430087237] [2023-08-30 02:44:52,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:44:52,866 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:52,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:52,868 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:44:52,871 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:44:52,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:44:52,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:52,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:44:52,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:53,035 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:53,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:53,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430087237] [2023-08-30 02:44:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430087237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:44:53,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898748458] [2023-08-30 02:44:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:53,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:44:53,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:44:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:44:53,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-30 02:44:53,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:53,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:53,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-30 02:44:53,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:53,413 INFO L130 PetriNetUnfolder]: 2066/3335 cut-off events. [2023-08-30 02:44:53,413 INFO L131 PetriNetUnfolder]: For 1118/1118 co-relation queries the response was YES. [2023-08-30 02:44:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8171 conditions, 3335 events. 2066/3335 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19924 event pairs, 239 based on Foata normal form. 1/3321 useless extension candidates. Maximal degree in co-relation 8165. Up to 1642 conditions per place. [2023-08-30 02:44:53,434 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 92 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2023-08-30 02:44:53,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 524 flow [2023-08-30 02:44:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:44:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:44:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2023-08-30 02:44:53,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2023-08-30 02:44:53,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2023-08-30 02:44:53,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2023-08-30 02:44:53,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:53,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2023-08-30 02:44:53,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call 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:53,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call 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:53,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call 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:53,442 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 148 flow. Second operand 4 states and 568 transitions. [2023-08-30 02:44:53,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 524 flow [2023-08-30 02:44:53,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 98 transitions, 513 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 02:44:53,451 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 155 flow [2023-08-30 02:44:53,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-30 02:44:53,453 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-30 02:44:53,453 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 155 flow [2023-08-30 02:44:53,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:53,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:53,454 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:53,467 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:44:53,665 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:44:53,665 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:53,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1723265681, now seen corresponding path program 3 times [2023-08-30 02:44:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649266661] [2023-08-30 02:44:53,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:44:53,667 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:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:53,668 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:44:53,671 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:44:53,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:44:53,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:44:53,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:44:53,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:53,813 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:53,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:53,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649266661] [2023-08-30 02:44:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649266661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:53,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:44:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575744670] [2023-08-30 02:44:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:53,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:44:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:44:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:44:53,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 282 [2023-08-30 02:44:53,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call 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:53,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:53,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 282 [2023-08-30 02:44:53,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:54,320 INFO L130 PetriNetUnfolder]: 3389/5324 cut-off events. [2023-08-30 02:44:54,321 INFO L131 PetriNetUnfolder]: For 1913/1913 co-relation queries the response was YES. [2023-08-30 02:44:54,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13393 conditions, 5324 events. 3389/5324 cut-off events. For 1913/1913 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33230 event pairs, 1268 based on Foata normal form. 1/5206 useless extension candidates. Maximal degree in co-relation 13385. Up to 2833 conditions per place. [2023-08-30 02:44:54,351 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 71 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-30 02:44:54,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 414 flow [2023-08-30 02:44:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:44:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:44:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-30 02:44:54,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508274231678487 [2023-08-30 02:44:54,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-30 02:44:54,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-30 02:44:54,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:54,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-30 02:44:54,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call 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:54,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call 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:54,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call 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:54,357 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 155 flow. Second operand 3 states and 430 transitions. [2023-08-30 02:44:54,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 414 flow [2023-08-30 02:44:54,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:54,359 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 166 flow [2023-08-30 02:44:54,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-30 02:44:54,360 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-30 02:44:54,360 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 166 flow [2023-08-30 02:44:54,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call 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:54,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:54,360 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:54,375 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:44:54,571 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:44:54,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:44:54,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1254178618, now seen corresponding path program 1 times [2023-08-30 02:44:54,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:54,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381422122] [2023-08-30 02:44:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:44:54,573 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:54,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:54,575 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:44:54,578 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:44:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:44:54,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:44:54,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:44:55,409 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:55,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:44:55,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:44:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381422122] [2023-08-30 02:44:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381422122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:44:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:44:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:44:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392654205] [2023-08-30 02:44:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:44:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:44:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:44:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:44:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:44:55,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 282 [2023-08-30 02:44:55,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:55,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:44:55,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 282 [2023-08-30 02:44:55,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:44:56,542 INFO L130 PetriNetUnfolder]: 2879/4532 cut-off events. [2023-08-30 02:44:56,542 INFO L131 PetriNetUnfolder]: For 1568/1568 co-relation queries the response was YES. [2023-08-30 02:44:56,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11963 conditions, 4532 events. 2879/4532 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27271 event pairs, 729 based on Foata normal form. 8/4464 useless extension candidates. Maximal degree in co-relation 11954. Up to 3873 conditions per place. [2023-08-30 02:44:56,557 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 46 selfloop transitions, 4 changer transitions 17/72 dead transitions. [2023-08-30 02:44:56,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 393 flow [2023-08-30 02:44:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:44:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:44:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-30 02:44:56,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4190307328605201 [2023-08-30 02:44:56,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-30 02:44:56,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-30 02:44:56,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:44:56,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-30 02:44:56,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:56,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call 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:56,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call 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:56,566 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 166 flow. Second operand 6 states and 709 transitions. [2023-08-30 02:44:56,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 393 flow [2023-08-30 02:44:56,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:44:56,569 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 150 flow [2023-08-30 02:44:56,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-08-30 02:44:56,570 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-30 02:44:56,570 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 150 flow [2023-08-30 02:44:56,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:44:56,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:44:56,571 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:56,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:44:56,781 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:44:56,782 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:56,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:44:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash 11641939, now seen corresponding path program 4 times [2023-08-30 02:44:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:44:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913055888] [2023-08-30 02:44:56,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:44:56,783 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:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:44:56,784 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:44:56,787 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:44:56,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:44:56,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:44:56,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:44:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:44:57,102 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:44:57,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:44:57,103 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:44:57,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:44:57,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:44:57,120 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:44:57,320 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:44:57,321 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:44:57,326 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:44:57,327 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:44:57,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:44:57 BasicIcfg [2023-08-30 02:44:57,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:44:57,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:44:57,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:44:57,421 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:44:57,422 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:36" (3/4) ... [2023-08-30 02:44:57,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:44:57,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:44:57,425 INFO L158 Benchmark]: Toolchain (without parser) took 22840.74ms. Allocated memory was 73.4MB in the beginning and 1.7GB in the end (delta: 1.7GB). Free memory was 48.9MB in the beginning and 982.2MB in the end (delta: -933.3MB). Peak memory consumption was 718.6MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,425 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:44:57,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.60ms. Allocated memory is still 73.4MB. Free memory was 48.7MB in the beginning and 41.0MB in the end (delta: 7.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 73.4MB. Free memory was 40.6MB in the beginning and 38.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,425 INFO L158 Benchmark]: Boogie Preprocessor took 50.24ms. Allocated memory is still 73.4MB. Free memory was 38.2MB in the beginning and 36.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,426 INFO L158 Benchmark]: RCFGBuilder took 810.10ms. Allocated memory is still 73.4MB. Free memory was 36.1MB in the beginning and 36.8MB in the end (delta: -718.1kB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,429 INFO L158 Benchmark]: TraceAbstraction took 21344.60ms. Allocated memory was 73.4MB in the beginning and 1.7GB in the end (delta: 1.7GB). Free memory was 36.4MB in the beginning and 983.2MB in the end (delta: -946.9MB). Peak memory consumption was 703.2MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,429 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.7GB. Free memory was 983.2MB in the beginning and 982.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:44:57,431 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.17ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.60ms. Allocated memory is still 73.4MB. Free memory was 48.7MB in the beginning and 41.0MB in the end (delta: 7.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 73.4MB. Free memory was 40.6MB in the beginning and 38.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.24ms. Allocated memory is still 73.4MB. Free memory was 38.2MB in the beginning and 36.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 810.10ms. Allocated memory is still 73.4MB. Free memory was 36.1MB in the beginning and 36.8MB in the end (delta: -718.1kB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21344.60ms. Allocated memory was 73.4MB in the beginning and 1.7GB in the end (delta: 1.7GB). Free memory was 36.4MB in the beginning and 983.2MB in the end (delta: -946.9MB). Peak memory consumption was 703.2MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.7GB. Free memory was 983.2MB in the beginning and 982.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 153 PlacesBefore, 53 PlacesAfterwards, 142 TransitionsBefore, 40 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 10768 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4660, independent: 4402, independent conditional: 0, independent unconditional: 4402, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1947, independent: 1891, independent conditional: 0, independent unconditional: 1891, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4660, independent: 2511, independent conditional: 0, independent unconditional: 2511, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1947, unknown conditional: 0, unknown unconditional: 1947] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t177, ((void *)0), P0, ((void *)0))=0, t177={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t178, ((void *)0), P1, ((void *)0))=1, t177={11:0}, t178={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, z=0] [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t179, ((void *)0), P2, ((void *)0))=2, t177={11:0}, t178={15:0}, t179={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=0] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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_p0_EAX=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=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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, pthread_create(&t180, ((void *)0), P3, ((void *)0))=3, t177={11:0}, t178={15:0}, t179={7:0}, t180={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 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) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=1] [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=1] [L813] 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) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 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 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 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_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 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) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 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 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t177={11:0}, t178={15:0}, t179={7:0}, t180={-2147483637:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 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 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 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_p0_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t177={11:0}, t178={15:0}, t179={7:0}, t180={-2147483637:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_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=1, 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: 869]: 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: 878]: 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, 184 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: 21.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 654 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 581 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1658 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 23 mSDtfsCounter, 1658 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 47, 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.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 179 ConstructedInterpolants, 19 QuantifiedInterpolants, 1975 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1523 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:57,458 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