./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:16:19,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:16:19,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:16:19,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:16:19,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:16:19,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:16:19,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:16:19,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:16:19,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:16:19,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:16:19,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:16:19,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:16:19,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:16:19,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:16:19,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:16:19,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:16:19,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:16:19,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:16:19,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:16:19,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:16:19,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:16:19,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:16:19,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:16:19,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:16:19,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:16:19,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:16:19,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:16:19,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:16:19,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:16:19,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:16:19,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:16:19,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:16:19,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:16:19,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:16:19,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:16:19,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:16:19,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:16:19,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:16:19,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:16:19,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:16:19,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:16:19,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:16:19,614 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:16:19,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:16:19,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:16:19,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:16:19,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:16:19,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:16:19,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:16:19,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:16:19,618 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:16:19,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:16:19,619 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:16:19,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:16:19,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:16:19,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:16:19,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:16:19,620 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:16:19,621 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:16:19,621 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:16:19,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:16:19,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:16:19,621 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:16:19,622 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:16:19,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:16:19,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:16:19,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:16:19,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:16:19,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:16:19,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:16:19,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:16:19,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:16:19,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:16:19,624 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:16:19,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:16:19,625 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:16:19,625 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:16:19,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:16:19,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:16:19,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:16:19,985 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:16:19,986 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:16:19,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-08-31 23:16:21,092 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:16:21,357 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:16:21,358 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-08-31 23:16:21,382 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba0739c1/82d28e1c70fd48b4b14b46898c39d38e/FLAG7215c550e [2023-08-31 23:16:21,393 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba0739c1/82d28e1c70fd48b4b14b46898c39d38e [2023-08-31 23:16:21,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:16:21,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:16:21,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:16:21,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:16:21,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:16:21,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:16:21" (1/1) ... [2023-08-31 23:16:21,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305b4f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:21, skipping insertion in model container [2023-08-31 23:16:21,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:16:21" (1/1) ... [2023-08-31 23:16:21,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:16:21,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:16:21,579 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/mix027_tso.i[944,957] [2023-08-31 23:16:21,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:16:21,836 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:16:21,849 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/mix027_tso.i[944,957] [2023-08-31 23:16:21,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:16:22,002 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:16:22,002 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:16:22,008 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:16:22,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22 WrapperNode [2023-08-31 23:16:22,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:16:22,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:16:22,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:16:22,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:16:22,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,090 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-31 23:16:22,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:16:22,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:16:22,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:16:22,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:16:22,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,138 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:16:22,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:16:22,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:16:22,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:16:22,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (1/1) ... [2023-08-31 23:16:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:16:22,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:16:22,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:16:22,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:16:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:16:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:16:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:16:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:16:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:16:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:16:22,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:16:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:16:22,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:16:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:16:22,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:16:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:16:22,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:16:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:16:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:16:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:16:22,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:16:22,222 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:16:22,426 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:16:22,428 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:16:22,721 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:16:22,909 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:16:22,909 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:16:22,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:22 BoogieIcfgContainer [2023-08-31 23:16:22,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:16:22,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:16:22,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:16:22,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:16:22,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:16:21" (1/3) ... [2023-08-31 23:16:22,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae44b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:16:22, skipping insertion in model container [2023-08-31 23:16:22,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:16:22" (2/3) ... [2023-08-31 23:16:22,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae44b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:16:22, skipping insertion in model container [2023-08-31 23:16:22,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:22" (3/3) ... [2023-08-31 23:16:22,930 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-08-31 23:16:22,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:16:22,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:16:22,946 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:16:23,025 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:16:23,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:16:23,142 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:16:23,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:23,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:16:23,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:16:23,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-31 23:16:23,159 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:16:23,181 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:16:23,184 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:16:23,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-31 23:16:23,242 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:16:23,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:23,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:16:23,247 INFO L119 LiptonReduction]: Number of co-enabled transitions 3506 [2023-08-31 23:16:29,678 INFO L134 LiptonReduction]: Checked pairs total: 10499 [2023-08-31 23:16:29,678 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:16:29,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:16:29,696 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;@c8e0ef0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:16:29,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:16:29,698 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:16:29,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:29,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:29,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:16:29,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:29,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 607, now seen corresponding path program 1 times [2023-08-31 23:16:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878854966] [2023-08-31 23:16:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:29,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878854966] [2023-08-31 23:16:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878854966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:29,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:29,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:16:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966015444] [2023-08-31 23:16:29,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:16:29,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:16:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:16:29,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 278 [2023-08-31 23:16:29,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:29,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:29,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 278 [2023-08-31 23:16:29,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:31,198 INFO L130 PetriNetUnfolder]: 5973/8378 cut-off events. [2023-08-31 23:16:31,198 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-31 23:16:31,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16696 conditions, 8378 events. 5973/8378 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 45212 event pairs, 5973 based on Foata normal form. 0/6985 useless extension candidates. Maximal degree in co-relation 16684. Up to 8103 conditions per place. [2023-08-31 23:16:31,255 INFO L137 encePairwiseOnDemand]: 270/278 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:16:31,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-31 23:16:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:16:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:16:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 288 transitions. [2023-08-31 23:16:31,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179856115107914 [2023-08-31 23:16:31,274 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 288 transitions. [2023-08-31 23:16:31,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 288 transitions. [2023-08-31 23:16:31,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:31,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 288 transitions. [2023-08-31 23:16:31,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.0) internal successors, (288), 2 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,286 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,288 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 288 transitions. [2023-08-31 23:16:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-31 23:16:31,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:31,295 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:16:31,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:16:31,300 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:16:31,300 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:16:31,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:31,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:16:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:16:31,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:31,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 573127567, now seen corresponding path program 1 times [2023-08-31 23:16:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:31,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299631988] [2023-08-31 23:16:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299631988] [2023-08-31 23:16:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299631988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:16:31,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403620840] [2023-08-31 23:16:31,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:31,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:16:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:16:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:16:31,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 278 [2023-08-31 23:16:31,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:31,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:31,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 278 [2023-08-31 23:16:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:32,566 INFO L130 PetriNetUnfolder]: 4695/6881 cut-off events. [2023-08-31 23:16:32,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:16:32,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13454 conditions, 6881 events. 4695/6881 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 41039 event pairs, 861 based on Foata normal form. 0/6284 useless extension candidates. Maximal degree in co-relation 13451. Up to 5107 conditions per place. [2023-08-31 23:16:32,599 INFO L137 encePairwiseOnDemand]: 275/278 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-31 23:16:32,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2023-08-31 23:16:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:16:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:16:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-31 23:16:32,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059952038369304 [2023-08-31 23:16:32,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-31 23:16:32,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-31 23:16:32,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:32,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-31 23:16:32,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,607 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 422 transitions. [2023-08-31 23:16:32,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2023-08-31 23:16:32,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:16:32,609 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-31 23:16:32,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:16:32,610 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:16:32,610 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-31 23:16:32,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:32,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:32,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:32,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:16:32,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:32,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 251898826, now seen corresponding path program 1 times [2023-08-31 23:16:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160284122] [2023-08-31 23:16:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160284122] [2023-08-31 23:16:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160284122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:16:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589160274] [2023-08-31 23:16:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:33,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:33,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:33,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 278 [2023-08-31 23:16:33,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:33,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:33,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 278 [2023-08-31 23:16:33,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:35,051 INFO L130 PetriNetUnfolder]: 10635/14405 cut-off events. [2023-08-31 23:16:35,051 INFO L131 PetriNetUnfolder]: For 749/749 co-relation queries the response was YES. [2023-08-31 23:16:35,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29816 conditions, 14405 events. 10635/14405 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 71319 event pairs, 2919 based on Foata normal form. 0/14004 useless extension candidates. Maximal degree in co-relation 29812. Up to 8853 conditions per place. [2023-08-31 23:16:35,120 INFO L137 encePairwiseOnDemand]: 265/278 looper letters, 47 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2023-08-31 23:16:35,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 254 flow [2023-08-31 23:16:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:16:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:16:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-31 23:16:35,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46492805755395683 [2023-08-31 23:16:35,122 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-31 23:16:35,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-31 23:16:35,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:35,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-31 23:16:35,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,128 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,128 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 517 transitions. [2023-08-31 23:16:35,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 254 flow [2023-08-31 23:16:35,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:35,131 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 158 flow [2023-08-31 23:16:35,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-31 23:16:35,133 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-31 23:16:35,135 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 158 flow [2023-08-31 23:16:35,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:35,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:35,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:16:35,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:35,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash 251898842, now seen corresponding path program 1 times [2023-08-31 23:16:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:35,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382988746] [2023-08-31 23:16:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382988746] [2023-08-31 23:16:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382988746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905463040] [2023-08-31 23:16:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:35,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:35,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:35,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 278 [2023-08-31 23:16:35,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:35,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:35,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 278 [2023-08-31 23:16:35,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:36,928 INFO L130 PetriNetUnfolder]: 5917/8384 cut-off events. [2023-08-31 23:16:36,928 INFO L131 PetriNetUnfolder]: For 4183/4715 co-relation queries the response was YES. [2023-08-31 23:16:36,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22605 conditions, 8384 events. 5917/8384 cut-off events. For 4183/4715 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45020 event pairs, 1244 based on Foata normal form. 744/8861 useless extension candidates. Maximal degree in co-relation 22599. Up to 6858 conditions per place. [2023-08-31 23:16:36,980 INFO L137 encePairwiseOnDemand]: 273/278 looper letters, 43 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-08-31 23:16:36,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 294 flow [2023-08-31 23:16:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-08-31 23:16:36,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4136690647482014 [2023-08-31 23:16:36,983 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-08-31 23:16:36,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-08-31 23:16:36,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:36,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-08-31 23:16:36,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-31 23:16:36,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,988 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:36,988 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 158 flow. Second operand 6 states and 690 transitions. [2023-08-31 23:16:36,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 294 flow [2023-08-31 23:16:36,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:16:36,999 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 154 flow [2023-08-31 23:16:36,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-31 23:16:37,000 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-31 23:16:37,000 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 154 flow [2023-08-31 23:16:37,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:37,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:37,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:16:37,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:37,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1554709511, now seen corresponding path program 1 times [2023-08-31 23:16:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941042856] [2023-08-31 23:16:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941042856] [2023-08-31 23:16:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941042856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:37,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:16:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403727949] [2023-08-31 23:16:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:37,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:37,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:37,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:37,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:37,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 278 [2023-08-31 23:16:37,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:37,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:37,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 278 [2023-08-31 23:16:37,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:38,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([556] L869-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd0~0_98 256) 0)) (.cse11 (= 0 (mod v_~x$r_buff0_thd0~0_96 256)))) (let ((.cse12 (not .cse11)) (.cse13 (= 0 (mod v_~x$w_buff0_used~0_210 256))) (.cse1 (and .cse11 (= (mod v_~x$w_buff1_used~0_175 256) 0))) (.cse3 (and .cse6 .cse11))) (let ((.cse4 (or .cse13 .cse1 .cse3)) (.cse5 (and (not .cse13) .cse12))) (let ((.cse10 (ite .cse4 v_~x~0_124 (ite .cse5 v_~x$w_buff0~0_105 v_~x$w_buff1~0_86))) (.cse0 (not (= (mod v_~weak$$choice2~0_44 256) 0))) (.cse8 (= (mod v_~x$w_buff1_used~0_174 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_209 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0) (= v_~x$mem_tmp~0_30 v_~x~0_124) (= v_~x$w_buff1_used~0_174 (ite .cse0 v_~x$w_buff1_used~0_175 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_175 0))) (= v_~x$w_buff0_used~0_209 (ite .cse0 v_~x$w_buff0_used~0_210 (ite .cse4 v_~x$w_buff0_used~0_210 (ite .cse5 0 v_~x$w_buff0_used~0_210)))) (= v_~x$flush_delayed~0_39 0) (= v_~x$w_buff0~0_105 v_~x$w_buff0~0_104) (= v_~x$w_buff1~0_86 v_~x$w_buff1~0_85) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~x$r_buff1_thd0~0_97 (ite .cse0 v_~x$r_buff1_thd0~0_98 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_95 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse2)) v_~x$r_buff1_thd0~0_98 0))) (= (let ((.cse9 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse9 2147483647) .cse9 (+ .cse9 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= (ite .cse0 v_~x$mem_tmp~0_30 .cse10) v_~x~0_123) (= (ite (= (ite (not (and (= 2 .cse10) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff0_thd0~0_95 (ite .cse0 v_~x$r_buff0_thd0~0_96 (ite (or (and .cse8 .cse11) .cse2 .cse3) v_~x$r_buff0_thd0~0_96 (ite (and (not .cse2) .cse12) 0 v_~x$r_buff0_thd0~0_96))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_105, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~z~0=v_~z~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_98, ~x~0=v_~x~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_33|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_44, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][47], [Black: 165#(= ~__unbuffered_p3_EAX~0 0), 41#L784true, Black: 166#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 36#L824true, 71#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 117#L804true, 156#true, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 176#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 163#true, 121#L754true, 178#true]) [2023-08-31 23:16:38,114 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:16:38,115 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:16:38,115 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:16:38,115 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:16:38,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([556] L869-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd0~0_98 256) 0)) (.cse11 (= 0 (mod v_~x$r_buff0_thd0~0_96 256)))) (let ((.cse12 (not .cse11)) (.cse13 (= 0 (mod v_~x$w_buff0_used~0_210 256))) (.cse1 (and .cse11 (= (mod v_~x$w_buff1_used~0_175 256) 0))) (.cse3 (and .cse6 .cse11))) (let ((.cse4 (or .cse13 .cse1 .cse3)) (.cse5 (and (not .cse13) .cse12))) (let ((.cse10 (ite .cse4 v_~x~0_124 (ite .cse5 v_~x$w_buff0~0_105 v_~x$w_buff1~0_86))) (.cse0 (not (= (mod v_~weak$$choice2~0_44 256) 0))) (.cse8 (= (mod v_~x$w_buff1_used~0_174 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_209 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0) (= v_~x$mem_tmp~0_30 v_~x~0_124) (= v_~x$w_buff1_used~0_174 (ite .cse0 v_~x$w_buff1_used~0_175 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_175 0))) (= v_~x$w_buff0_used~0_209 (ite .cse0 v_~x$w_buff0_used~0_210 (ite .cse4 v_~x$w_buff0_used~0_210 (ite .cse5 0 v_~x$w_buff0_used~0_210)))) (= v_~x$flush_delayed~0_39 0) (= v_~x$w_buff0~0_105 v_~x$w_buff0~0_104) (= v_~x$w_buff1~0_86 v_~x$w_buff1~0_85) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~x$r_buff1_thd0~0_97 (ite .cse0 v_~x$r_buff1_thd0~0_98 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_95 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse2)) v_~x$r_buff1_thd0~0_98 0))) (= (let ((.cse9 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse9 2147483647) .cse9 (+ .cse9 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= (ite .cse0 v_~x$mem_tmp~0_30 .cse10) v_~x~0_123) (= (ite (= (ite (not (and (= 2 .cse10) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff0_thd0~0_95 (ite .cse0 v_~x$r_buff0_thd0~0_96 (ite (or (and .cse8 .cse11) .cse2 .cse3) v_~x$r_buff0_thd0~0_96 (ite (and (not .cse2) .cse12) 0 v_~x$r_buff0_thd0~0_96))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_105, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~z~0=v_~z~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_98, ~x~0=v_~x~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_33|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_44, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][47], [41#L784true, Black: 165#(= ~__unbuffered_p3_EAX~0 0), Black: 166#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 36#L824true, 117#L804true, 71#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 156#true, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, P2Thread1of1ForFork1InUse, 128#P0EXITtrue, P1Thread1of1ForFork2InUse, 176#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 163#true, 178#true]) [2023-08-31 23:16:38,346 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,346 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,346 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,346 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,388 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([556] L869-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd0~0_98 256) 0)) (.cse11 (= 0 (mod v_~x$r_buff0_thd0~0_96 256)))) (let ((.cse12 (not .cse11)) (.cse13 (= 0 (mod v_~x$w_buff0_used~0_210 256))) (.cse1 (and .cse11 (= (mod v_~x$w_buff1_used~0_175 256) 0))) (.cse3 (and .cse6 .cse11))) (let ((.cse4 (or .cse13 .cse1 .cse3)) (.cse5 (and (not .cse13) .cse12))) (let ((.cse10 (ite .cse4 v_~x~0_124 (ite .cse5 v_~x$w_buff0~0_105 v_~x$w_buff1~0_86))) (.cse0 (not (= (mod v_~weak$$choice2~0_44 256) 0))) (.cse8 (= (mod v_~x$w_buff1_used~0_174 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_209 256) 0))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0) (= v_~x$mem_tmp~0_30 v_~x~0_124) (= v_~x$w_buff1_used~0_174 (ite .cse0 v_~x$w_buff1_used~0_175 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_175 0))) (= v_~x$w_buff0_used~0_209 (ite .cse0 v_~x$w_buff0_used~0_210 (ite .cse4 v_~x$w_buff0_used~0_210 (ite .cse5 0 v_~x$w_buff0_used~0_210)))) (= v_~x$flush_delayed~0_39 0) (= v_~x$w_buff0~0_105 v_~x$w_buff0~0_104) (= v_~x$w_buff1~0_86 v_~x$w_buff1~0_85) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~x$r_buff1_thd0~0_97 (ite .cse0 v_~x$r_buff1_thd0~0_98 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_95 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) .cse2)) v_~x$r_buff1_thd0~0_98 0))) (= (let ((.cse9 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse9 2147483647) .cse9 (+ .cse9 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= (ite .cse0 v_~x$mem_tmp~0_30 .cse10) v_~x~0_123) (= (ite (= (ite (not (and (= 2 .cse10) (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff0_thd0~0_95 (ite .cse0 v_~x$r_buff0_thd0~0_96 (ite (or (and .cse8 .cse11) .cse2 .cse3) v_~x$r_buff0_thd0~0_96 (ite (and (not .cse2) .cse12) 0 v_~x$r_buff0_thd0~0_96))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_105, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~z~0=v_~z~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_98, ~x~0=v_~x~0_124, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ~x$flush_delayed~0=v_~x$flush_delayed~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_85, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_33|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_44, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][47], [Black: 165#(= ~__unbuffered_p3_EAX~0 0), 41#L784true, Black: 166#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 36#L824true, 71#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 156#true, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, P2Thread1of1ForFork1InUse, 21#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 121#L754true, 163#true, 178#true]) [2023-08-31 23:16:38,388 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,388 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,388 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,388 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:16:38,674 INFO L130 PetriNetUnfolder]: 7600/10443 cut-off events. [2023-08-31 23:16:38,674 INFO L131 PetriNetUnfolder]: For 4078/4358 co-relation queries the response was YES. [2023-08-31 23:16:38,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27921 conditions, 10443 events. 7600/10443 cut-off events. For 4078/4358 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 53028 event pairs, 2926 based on Foata normal form. 167/10123 useless extension candidates. Maximal degree in co-relation 27914. Up to 9101 conditions per place. [2023-08-31 23:16:38,727 INFO L137 encePairwiseOnDemand]: 272/278 looper letters, 43 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-08-31 23:16:38,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 340 flow [2023-08-31 23:16:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:16:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:16:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:16:38,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988009592326139 [2023-08-31 23:16:38,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:16:38,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:16:38,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:38,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:16:38,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:38,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:38,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:38,734 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 154 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:16:38,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 340 flow [2023-08-31 23:16:38,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:38,738 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 219 flow [2023-08-31 23:16:38,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-31 23:16:38,739 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:16:38,739 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 219 flow [2023-08-31 23:16:38,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:38,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:38,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:38,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:16:38,740 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:38,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1425155258, now seen corresponding path program 1 times [2023-08-31 23:16:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612448230] [2023-08-31 23:16:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612448230] [2023-08-31 23:16:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612448230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:39,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759685771] [2023-08-31 23:16:39,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:39,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:39,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:39,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:39,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 278 [2023-08-31 23:16:39,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:39,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:39,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 278 [2023-08-31 23:16:39,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:40,711 INFO L130 PetriNetUnfolder]: 8969/12660 cut-off events. [2023-08-31 23:16:40,711 INFO L131 PetriNetUnfolder]: For 9538/9904 co-relation queries the response was YES. [2023-08-31 23:16:40,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37646 conditions, 12660 events. 8969/12660 cut-off events. For 9538/9904 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 70906 event pairs, 1579 based on Foata normal form. 408/12654 useless extension candidates. Maximal degree in co-relation 37638. Up to 7936 conditions per place. [2023-08-31 23:16:40,800 INFO L137 encePairwiseOnDemand]: 270/278 looper letters, 85 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2023-08-31 23:16:40,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 109 transitions, 705 flow [2023-08-31 23:16:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2023-08-31 23:16:40,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940047961630695 [2023-08-31 23:16:40,803 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2023-08-31 23:16:40,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2023-08-31 23:16:40,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:40,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2023-08-31 23:16:40,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,808 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,809 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 219 flow. Second operand 6 states and 824 transitions. [2023-08-31 23:16:40,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 109 transitions, 705 flow [2023-08-31 23:16:40,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 109 transitions, 692 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:16:40,815 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 351 flow [2023-08-31 23:16:40,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2023-08-31 23:16:40,816 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:16:40,816 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 351 flow [2023-08-31 23:16:40,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:40,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:40,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:40,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:16:40,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:40,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash 422167544, now seen corresponding path program 1 times [2023-08-31 23:16:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846295057] [2023-08-31 23:16:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:41,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846295057] [2023-08-31 23:16:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846295057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818329270] [2023-08-31 23:16:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:41,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:41,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 278 [2023-08-31 23:16:41,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:41,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:41,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 278 [2023-08-31 23:16:41,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:43,124 INFO L130 PetriNetUnfolder]: 15316/21052 cut-off events. [2023-08-31 23:16:43,124 INFO L131 PetriNetUnfolder]: For 25071/25725 co-relation queries the response was YES. [2023-08-31 23:16:43,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72138 conditions, 21052 events. 15316/21052 cut-off events. For 25071/25725 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 113562 event pairs, 4101 based on Foata normal form. 522/21557 useless extension candidates. Maximal degree in co-relation 72128. Up to 11256 conditions per place. [2023-08-31 23:16:43,260 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 79 selfloop transitions, 10 changer transitions 4/97 dead transitions. [2023-08-31 23:16:43,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 726 flow [2023-08-31 23:16:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:16:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:16:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-31 23:16:43,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46402877697841727 [2023-08-31 23:16:43,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-31 23:16:43,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-31 23:16:43,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:43,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-31 23:16:43,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:43,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:43,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:43,267 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 351 flow. Second operand 4 states and 516 transitions. [2023-08-31 23:16:43,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 726 flow [2023-08-31 23:16:43,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 707 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-31 23:16:43,291 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 389 flow [2023-08-31 23:16:43,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2023-08-31 23:16:43,292 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-31 23:16:43,292 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 389 flow [2023-08-31 23:16:43,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:43,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:43,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:43,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:16:43,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:43,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash -572888090, now seen corresponding path program 1 times [2023-08-31 23:16:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655084253] [2023-08-31 23:16:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655084253] [2023-08-31 23:16:43,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655084253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:43,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:43,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910436192] [2023-08-31 23:16:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:43,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:43,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 278 [2023-08-31 23:16:43,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:43,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:43,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 278 [2023-08-31 23:16:43,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:45,628 INFO L130 PetriNetUnfolder]: 11890/17129 cut-off events. [2023-08-31 23:16:45,629 INFO L131 PetriNetUnfolder]: For 33860/34488 co-relation queries the response was YES. [2023-08-31 23:16:45,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61589 conditions, 17129 events. 11890/17129 cut-off events. For 33860/34488 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 102826 event pairs, 5365 based on Foata normal form. 232/16947 useless extension candidates. Maximal degree in co-relation 61577. Up to 14194 conditions per place. [2023-08-31 23:16:45,721 INFO L137 encePairwiseOnDemand]: 274/278 looper letters, 67 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2023-08-31 23:16:45,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 637 flow [2023-08-31 23:16:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:16:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:16:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-31 23:16:45,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-31 23:16:45,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-31 23:16:45,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-31 23:16:45,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:45,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-31 23:16:45,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:45,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:45,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:45,737 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 389 flow. Second operand 3 states and 417 transitions. [2023-08-31 23:16:45,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 637 flow [2023-08-31 23:16:45,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 623 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-31 23:16:45,751 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 397 flow [2023-08-31 23:16:45,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-08-31 23:16:45,754 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-31 23:16:45,754 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 397 flow [2023-08-31 23:16:45,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:45,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:45,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:45,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:16:45,755 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:45,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1852632344, now seen corresponding path program 1 times [2023-08-31 23:16:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297398373] [2023-08-31 23:16:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:45,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297398373] [2023-08-31 23:16:45,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297398373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:45,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:45,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018737432] [2023-08-31 23:16:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:45,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:45,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 278 [2023-08-31 23:16:46,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 397 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-31 23:16:46,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:46,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 278 [2023-08-31 23:16:46,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:47,622 INFO L130 PetriNetUnfolder]: 10148/14597 cut-off events. [2023-08-31 23:16:47,622 INFO L131 PetriNetUnfolder]: For 42139/44062 co-relation queries the response was YES. [2023-08-31 23:16:47,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55207 conditions, 14597 events. 10148/14597 cut-off events. For 42139/44062 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 89683 event pairs, 1586 based on Foata normal form. 1910/15849 useless extension candidates. Maximal degree in co-relation 55193. Up to 8532 conditions per place. [2023-08-31 23:16:47,690 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 109 selfloop transitions, 10 changer transitions 26/157 dead transitions. [2023-08-31 23:16:47,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 157 transitions, 1341 flow [2023-08-31 23:16:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:16:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:16:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-31 23:16:47,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4841726618705036 [2023-08-31 23:16:47,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-31 23:16:47,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-31 23:16:47,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:47,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-31 23:16:47,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:47,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:47,705 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:47,705 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 397 flow. Second operand 5 states and 673 transitions. [2023-08-31 23:16:47,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 157 transitions, 1341 flow [2023-08-31 23:16:47,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 157 transitions, 1315 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:16:47,719 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 459 flow [2023-08-31 23:16:47,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2023-08-31 23:16:47,720 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-08-31 23:16:47,720 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 459 flow [2023-08-31 23:16:47,721 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-31 23:16:47,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:47,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:47,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:16:47,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:47,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash 699122848, now seen corresponding path program 1 times [2023-08-31 23:16:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199037822] [2023-08-31 23:16:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199037822] [2023-08-31 23:16:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199037822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:47,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808879583] [2023-08-31 23:16:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:47,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:47,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 278 [2023-08-31 23:16:47,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 459 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:47,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:47,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 278 [2023-08-31 23:16:47,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:49,537 INFO L130 PetriNetUnfolder]: 8099/11914 cut-off events. [2023-08-31 23:16:49,537 INFO L131 PetriNetUnfolder]: For 40637/43233 co-relation queries the response was YES. [2023-08-31 23:16:49,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51370 conditions, 11914 events. 8099/11914 cut-off events. For 40637/43233 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 73808 event pairs, 695 based on Foata normal form. 1499/12895 useless extension candidates. Maximal degree in co-relation 51353. Up to 6389 conditions per place. [2023-08-31 23:16:49,584 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 135 selfloop transitions, 19 changer transitions 48/214 dead transitions. [2023-08-31 23:16:49,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 214 transitions, 1905 flow [2023-08-31 23:16:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:16:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:16:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2023-08-31 23:16:49,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4850976361767729 [2023-08-31 23:16:49,589 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2023-08-31 23:16:49,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2023-08-31 23:16:49,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:49,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2023-08-31 23:16:49,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:49,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:49,597 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:49,598 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 459 flow. Second operand 7 states and 944 transitions. [2023-08-31 23:16:49,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 214 transitions, 1905 flow [2023-08-31 23:16:49,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 214 transitions, 1900 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:16:49,649 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 567 flow [2023-08-31 23:16:49,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-31 23:16:49,651 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2023-08-31 23:16:49,651 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 567 flow [2023-08-31 23:16:49,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:49,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:49,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:16:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:16:49,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:49,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1179381412, now seen corresponding path program 1 times [2023-08-31 23:16:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511141033] [2023-08-31 23:16:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511141033] [2023-08-31 23:16:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511141033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:16:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173015389] [2023-08-31 23:16:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:49,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:16:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:16:49,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:16:49,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 278 [2023-08-31 23:16:49,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 567 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:49,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:49,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 278 [2023-08-31 23:16:49,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:51,381 INFO L130 PetriNetUnfolder]: 7334/10824 cut-off events. [2023-08-31 23:16:51,381 INFO L131 PetriNetUnfolder]: For 43543/45692 co-relation queries the response was YES. [2023-08-31 23:16:51,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51086 conditions, 10824 events. 7334/10824 cut-off events. For 43543/45692 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 67400 event pairs, 497 based on Foata normal form. 888/11230 useless extension candidates. Maximal degree in co-relation 51066. Up to 5625 conditions per place. [2023-08-31 23:16:51,430 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 139 selfloop transitions, 27 changer transitions 64/242 dead transitions. [2023-08-31 23:16:51,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 242 transitions, 2243 flow [2023-08-31 23:16:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:16:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:16:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1213 transitions. [2023-08-31 23:16:51,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848121502797762 [2023-08-31 23:16:51,435 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1213 transitions. [2023-08-31 23:16:51,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1213 transitions. [2023-08-31 23:16:51,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:51,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1213 transitions. [2023-08-31 23:16:51,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.77777777777777) internal successors, (1213), 9 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:51,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:51,442 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:51,442 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 567 flow. Second operand 9 states and 1213 transitions. [2023-08-31 23:16:51,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 242 transitions, 2243 flow [2023-08-31 23:16:52,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 242 transitions, 2181 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-31 23:16:52,031 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 659 flow [2023-08-31 23:16:52,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=659, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2023-08-31 23:16:52,032 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-31 23:16:52,032 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 659 flow [2023-08-31 23:16:52,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:52,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:52,033 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-31 23:16:52,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:16:52,034 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:52,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash -219799788, now seen corresponding path program 1 times [2023-08-31 23:16:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524196780] [2023-08-31 23:16:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524196780] [2023-08-31 23:16:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524196780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:16:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335299623] [2023-08-31 23:16:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:52,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:16:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:16:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:16:52,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 278 [2023-08-31 23:16:52,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 659 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:52,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:52,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 278 [2023-08-31 23:16:52,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:54,485 INFO L130 PetriNetUnfolder]: 14772/21792 cut-off events. [2023-08-31 23:16:54,485 INFO L131 PetriNetUnfolder]: For 82663/83156 co-relation queries the response was YES. [2023-08-31 23:16:54,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101843 conditions, 21792 events. 14772/21792 cut-off events. For 82663/83156 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 139372 event pairs, 3143 based on Foata normal form. 346/22138 useless extension candidates. Maximal degree in co-relation 101820. Up to 11800 conditions per place. [2023-08-31 23:16:54,624 INFO L137 encePairwiseOnDemand]: 266/278 looper letters, 114 selfloop transitions, 32 changer transitions 104/254 dead transitions. [2023-08-31 23:16:54,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 254 transitions, 2544 flow [2023-08-31 23:16:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:16:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:16:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-08-31 23:16:54,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634292565947242 [2023-08-31 23:16:54,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-08-31 23:16:54,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-08-31 23:16:54,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:54,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-08-31 23:16:54,629 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-31 23:16:54,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:54,632 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:54,632 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 659 flow. Second operand 6 states and 773 transitions. [2023-08-31 23:16:54,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 254 transitions, 2544 flow [2023-08-31 23:16:56,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 254 transitions, 2223 flow, removed 102 selfloop flow, removed 4 redundant places. [2023-08-31 23:16:56,745 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 773 flow [2023-08-31 23:16:56,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=773, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2023-08-31 23:16:56,746 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-31 23:16:56,746 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 773 flow [2023-08-31 23:16:56,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:56,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:56,746 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-31 23:16:56,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:16:56,746 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:56,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -271063706, now seen corresponding path program 2 times [2023-08-31 23:16:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50125818] [2023-08-31 23:16:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50125818] [2023-08-31 23:16:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50125818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:16:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369668149] [2023-08-31 23:16:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:57,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:16:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:57,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:16:57,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:16:57,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 278 [2023-08-31 23:16:57,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 773 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:57,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:57,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 278 [2023-08-31 23:16:57,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:16:58,630 INFO L130 PetriNetUnfolder]: 8162/12328 cut-off events. [2023-08-31 23:16:58,630 INFO L131 PetriNetUnfolder]: For 74945/78152 co-relation queries the response was YES. [2023-08-31 23:16:58,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63572 conditions, 12328 events. 8162/12328 cut-off events. For 74945/78152 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 82307 event pairs, 718 based on Foata normal form. 1065/12815 useless extension candidates. Maximal degree in co-relation 63544. Up to 7067 conditions per place. [2023-08-31 23:16:58,717 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 115 selfloop transitions, 22 changer transitions 107/254 dead transitions. [2023-08-31 23:16:58,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 254 transitions, 2762 flow [2023-08-31 23:16:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:16:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:16:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1445 transitions. [2023-08-31 23:16:58,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725310660562459 [2023-08-31 23:16:58,720 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1445 transitions. [2023-08-31 23:16:58,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1445 transitions. [2023-08-31 23:16:58,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:16:58,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1445 transitions. [2023-08-31 23:16:58,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 131.36363636363637) internal successors, (1445), 11 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 278.0) internal successors, (3336), 12 states have internal predecessors, (3336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,729 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 278.0) internal successors, (3336), 12 states have internal predecessors, (3336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:58,729 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 773 flow. Second operand 11 states and 1445 transitions. [2023-08-31 23:16:58,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 254 transitions, 2762 flow [2023-08-31 23:16:59,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 2695 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-08-31 23:16:59,111 INFO L231 Difference]: Finished difference. Result has 93 places, 64 transitions, 545 flow [2023-08-31 23:16:59,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=545, PETRI_PLACES=93, PETRI_TRANSITIONS=64} [2023-08-31 23:16:59,111 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2023-08-31 23:16:59,112 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 64 transitions, 545 flow [2023-08-31 23:16:59,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:16:59,112 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] [2023-08-31 23:16:59,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:16:59,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:16:59,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:16:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1722939806, now seen corresponding path program 1 times [2023-08-31 23:16:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:16:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555642722] [2023-08-31 23:16:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:16:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:16:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:16:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:16:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:16:59,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555642722] [2023-08-31 23:16:59,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555642722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:16:59,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:16:59,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:16:59,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248479359] [2023-08-31 23:16:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:16:59,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:16:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:16:59,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:16:59,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:16:59,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-08-31 23:16:59,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 64 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:16:59,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:16:59,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-08-31 23:16:59,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:00,037 INFO L130 PetriNetUnfolder]: 3980/6239 cut-off events. [2023-08-31 23:17:00,037 INFO L131 PetriNetUnfolder]: For 29803/30361 co-relation queries the response was YES. [2023-08-31 23:17:00,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33147 conditions, 6239 events. 3980/6239 cut-off events. For 29803/30361 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 37909 event pairs, 851 based on Foata normal form. 244/6286 useless extension candidates. Maximal degree in co-relation 33120. Up to 3075 conditions per place. [2023-08-31 23:17:00,071 INFO L137 encePairwiseOnDemand]: 275/278 looper letters, 50 selfloop transitions, 1 changer transitions 67/123 dead transitions. [2023-08-31 23:17:00,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 123 transitions, 1299 flow [2023-08-31 23:17:00,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-31 23:17:00,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48651079136690645 [2023-08-31 23:17:00,074 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-31 23:17:00,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-31 23:17:00,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:00,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-31 23:17:00,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,078 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,078 INFO L175 Difference]: Start difference. First operand has 93 places, 64 transitions, 545 flow. Second operand 4 states and 541 transitions. [2023-08-31 23:17:00,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 123 transitions, 1299 flow [2023-08-31 23:17:00,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 1078 flow, removed 51 selfloop flow, removed 13 redundant places. [2023-08-31 23:17:00,158 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 351 flow [2023-08-31 23:17:00,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2023-08-31 23:17:00,158 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-31 23:17:00,158 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 351 flow [2023-08-31 23:17:00,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:00,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:00,159 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] [2023-08-31 23:17:00,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:17:00,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:00,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1935399854, now seen corresponding path program 2 times [2023-08-31 23:17:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:17:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714963716] [2023-08-31 23:17:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:17:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:00,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:17:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:00,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:17:00,280 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:17:00,281 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:17:00,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:17:00,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:17:00,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:17:00,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:17:00,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:17:00,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:17:00,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:17:00,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:17:00,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:17:00,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:17:00,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:17:00,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:17:00,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:17:00,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:17:00,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:17:00,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:17:00,286 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:00,291 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:17:00,291 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:17:00,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:17:00 BasicIcfg [2023-08-31 23:17:00,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:17:00,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:17:00,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:17:00,358 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:17:00,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:16:22" (3/4) ... [2023-08-31 23:17:00,360 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:17:00,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:17:00,361 INFO L158 Benchmark]: Toolchain (without parser) took 38965.03ms. Allocated memory was 77.6MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 54.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-08-31 23:17:00,361 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:00,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.03ms. Allocated memory is still 77.6MB. Free memory was 53.7MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-08-31 23:17:00,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.24ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 48.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:00,362 INFO L158 Benchmark]: Boogie Preprocessor took 60.55ms. Allocated memory is still 77.6MB. Free memory was 48.5MB in the beginning and 46.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:00,362 INFO L158 Benchmark]: RCFGBuilder took 758.96ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 29.6MB in the end (delta: 16.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:00,363 INFO L158 Benchmark]: TraceAbstraction took 37432.11ms. Allocated memory was 77.6MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 53.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-08-31 23:17:00,363 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 3.1GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:00,364 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.21ms. Allocated memory is still 56.6MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.03ms. Allocated memory is still 77.6MB. Free memory was 53.7MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.24ms. Allocated memory is still 77.6MB. Free memory was 51.3MB in the beginning and 48.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.55ms. Allocated memory is still 77.6MB. Free memory was 48.5MB in the beginning and 46.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 758.96ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 29.6MB in the end (delta: 16.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 37432.11ms. Allocated memory was 77.6MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 53.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 3.1GB. Free memory was 1.2GB in the beginning and 1.2GB 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: 6.5s, 149 PlacesBefore, 52 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3506 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 10499 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4785, independent: 4532, independent conditional: 0, independent unconditional: 4532, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1808, independent conditional: 0, independent unconditional: 1808, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4785, independent: 2724, independent conditional: 0, independent unconditional: 2724, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1856, unknown conditional: 0, unknown unconditional: 1856] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t739; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 37.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 670 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1888 IncrementalHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 124 mSDtfsCounter, 1888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=773occurred in iteration=12, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:17:00,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:17:02,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:17:02,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:17:02,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:17:02,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:17:02,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:17:02,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:17:02,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:17:02,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:17:02,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:17:02,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:17:02,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:17:02,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:17:02,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:17:02,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:17:02,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:17:02,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:17:02,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:17:02,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:17:02,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:17:02,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:17:02,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:17:02,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:17:02,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:17:02,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:17:02,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:17:02,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:17:02,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:17:02,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:17:02,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:17:02,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:17:02,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:17:02,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:17:02,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:17:02,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:17:02,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:17:02,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:17:02,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:17:02,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:17:02,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:17:02,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:17:02,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:17:02,718 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:17:02,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:17:02,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:17:02,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:17:02,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:17:02,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:17:02,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:17:02,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:17:02,722 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:17:02,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:17:02,723 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:17:02,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:17:02,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:17:02,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:17:02,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:17:02,724 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:17:02,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:17:02,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:17:02,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:17:02,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:17:02,725 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:17:02,725 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:17:02,725 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:17:02,725 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:17:02,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:17:02,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:17:02,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:17:02,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:02,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:17:02,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:17:02,726 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:17:02,726 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:17:02,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:17:02,727 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:17:02,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:17:02,727 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:17:02,727 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:17:02,728 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:17:03,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:17:03,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:17:03,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:17:03,073 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:17:03,073 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:17:03,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-08-31 23:17:04,358 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:17:04,648 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:17:04,648 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2023-08-31 23:17:04,671 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dfbac66/fab313aee1a54a869689b2c1c6198f13/FLAG8f711e7a6 [2023-08-31 23:17:04,690 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dfbac66/fab313aee1a54a869689b2c1c6198f13 [2023-08-31 23:17:04,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:17:04,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:17:04,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:04,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:17:04,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:17:04,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:04" (1/1) ... [2023-08-31 23:17:04,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f420e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:04, skipping insertion in model container [2023-08-31 23:17:04,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:17:04" (1/1) ... [2023-08-31 23:17:04,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:17:04,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:17:04,935 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/mix027_tso.i[944,957] [2023-08-31 23:17:05,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:05,138 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:17:05,148 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/mix027_tso.i[944,957] [2023-08-31 23:17:05,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:17:05,209 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:05,210 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:17:05,216 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:17:05,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05 WrapperNode [2023-08-31 23:17:05,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:17:05,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:05,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:17:05,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:17:05,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,272 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-31 23:17:05,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:17:05,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:17:05,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:17:05,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:17:05,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,326 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:17:05,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:17:05,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:17:05,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:17:05,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (1/1) ... [2023-08-31 23:17:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:17:05,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:17:05,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:17:05,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:17:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:17:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:17:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:17:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:17:05,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:17:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:17:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:17:05,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:17:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:17:05,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:17:05,432 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:17:05,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:17:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:17:05,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:17:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:17:05,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:17:05,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:17:05,435 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:17:05,588 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:17:05,602 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:17:06,028 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:17:06,157 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:17:06,157 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:17:06,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:06 BoogieIcfgContainer [2023-08-31 23:17:06,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:17:06,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:17:06,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:17:06,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:17:06,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:17:04" (1/3) ... [2023-08-31 23:17:06,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792405f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:06, skipping insertion in model container [2023-08-31 23:17:06,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:17:05" (2/3) ... [2023-08-31 23:17:06,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792405f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:17:06, skipping insertion in model container [2023-08-31 23:17:06,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:06" (3/3) ... [2023-08-31 23:17:06,186 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-08-31 23:17:06,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:17:06,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:17:06,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:17:06,267 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:17:06,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:17:06,373 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:17:06,375 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:06,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:17:06,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:17:06,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:17:06,391 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:17:06,408 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:17:06,410 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:17:06,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:17:06,470 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:17:06,472 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:06,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:17:06,478 INFO L119 LiptonReduction]: Number of co-enabled transitions 3506 [2023-08-31 23:17:16,031 INFO L134 LiptonReduction]: Checked pairs total: 11176 [2023-08-31 23:17:16,031 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-31 23:17:16,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:17:16,073 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;@12751836, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:17:16,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:17:16,077 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:17:16,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:16,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:16,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:17:16,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:16,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash 607, now seen corresponding path program 1 times [2023-08-31 23:17:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:16,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737667717] [2023-08-31 23:17:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:16,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:16,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:17:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:16,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:17:16,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:16,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:16,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737667717] [2023-08-31 23:17:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737667717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:16,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:16,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:17:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236980702] [2023-08-31 23:17:16,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:16,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:17:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:17:16,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:17:16,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 278 [2023-08-31 23:17:16,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:16,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:16,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 278 [2023-08-31 23:17:16,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:17,652 INFO L130 PetriNetUnfolder]: 5973/8381 cut-off events. [2023-08-31 23:17:17,653 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:17:17,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16699 conditions, 8381 events. 5973/8381 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 45315 event pairs, 5973 based on Foata normal form. 0/6995 useless extension candidates. Maximal degree in co-relation 16687. Up to 8103 conditions per place. [2023-08-31 23:17:17,714 INFO L137 encePairwiseOnDemand]: 270/278 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:17:17,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-31 23:17:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:17:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:17:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-08-31 23:17:17,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215827338129496 [2023-08-31 23:17:17,732 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-08-31 23:17:17,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-08-31 23:17:17,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:17,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-08-31 23:17:17,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,750 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,752 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 290 transitions. [2023-08-31 23:17:17,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-31 23:17:17,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:17,762 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:17:17,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:17:17,768 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:17:17,768 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:17:17,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:17,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:17,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:17:17,782 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-31 23:17:17,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:17,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:17,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 573179526, now seen corresponding path program 1 times [2023-08-31 23:17:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969244371] [2023-08-31 23:17:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:17,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:17,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:17,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:17:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:18,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:18,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:18,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:18,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:18,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969244371] [2023-08-31 23:17:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969244371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:18,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:18,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:17:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290332101] [2023-08-31 23:17:18,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:18,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:18,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 278 [2023-08-31 23:17:18,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:18,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:18,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 278 [2023-08-31 23:17:18,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:19,057 INFO L130 PetriNetUnfolder]: 4695/6577 cut-off events. [2023-08-31 23:17:19,058 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:17:19,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13150 conditions, 6577 events. 4695/6577 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 33720 event pairs, 1757 based on Foata normal form. 0/5992 useless extension candidates. Maximal degree in co-relation 13147. Up to 5107 conditions per place. [2023-08-31 23:17:19,088 INFO L137 encePairwiseOnDemand]: 275/278 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-31 23:17:19,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2023-08-31 23:17:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:17:19,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095923261390888 [2023-08-31 23:17:19,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:17:19,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:17:19,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:19,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:17:19,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,098 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:17:19,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2023-08-31 23:17:19,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:17:19,100 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-31 23:17:19,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:17:19,101 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:17:19,101 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-31 23:17:19,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:19,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:19,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:19,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:19,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:19,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1550492774, now seen corresponding path program 1 times [2023-08-31 23:17:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:19,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080544239] [2023-08-31 23:17:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:19,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:19,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:19,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:17:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:19,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:19,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:19,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:19,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080544239] [2023-08-31 23:17:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080544239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:19,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479564698] [2023-08-31 23:17:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:19,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:19,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 278 [2023-08-31 23:17:19,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:19,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:19,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 278 [2023-08-31 23:17:19,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:20,090 INFO L130 PetriNetUnfolder]: 3224/4681 cut-off events. [2023-08-31 23:17:20,091 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-08-31 23:17:20,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9777 conditions, 4681 events. 3224/4681 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25138 event pairs, 626 based on Foata normal form. 256/4704 useless extension candidates. Maximal degree in co-relation 9773. Up to 3325 conditions per place. [2023-08-31 23:17:20,118 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 37 selfloop transitions, 5 changer transitions 25/72 dead transitions. [2023-08-31 23:17:20,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 302 flow [2023-08-31 23:17:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-31 23:17:20,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48848920863309353 [2023-08-31 23:17:20,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-31 23:17:20,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-31 23:17:20,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:20,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-31 23:17:20,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,126 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,127 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 679 transitions. [2023-08-31 23:17:20,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 302 flow [2023-08-31 23:17:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:20,130 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-08-31 23:17:20,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-31 23:17:20,132 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-31 23:17:20,132 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-08-31 23:17:20,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:20,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:20,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:20,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:20,345 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:20,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1666383265, now seen corresponding path program 1 times [2023-08-31 23:17:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798195830] [2023-08-31 23:17:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:20,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:20,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:20,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:20,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:17:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:20,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:20,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:20,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:20,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:20,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798195830] [2023-08-31 23:17:20,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798195830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:20,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:20,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851577602] [2023-08-31 23:17:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:20,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:17:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:17:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:17:20,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 278 [2023-08-31 23:17:20,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:20,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:20,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 278 [2023-08-31 23:17:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:21,083 INFO L130 PetriNetUnfolder]: 1712/2659 cut-off events. [2023-08-31 23:17:21,084 INFO L131 PetriNetUnfolder]: For 916/916 co-relation queries the response was YES. [2023-08-31 23:17:21,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7082 conditions, 2659 events. 1712/2659 cut-off events. For 916/916 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14039 event pairs, 330 based on Foata normal form. 175/2741 useless extension candidates. Maximal degree in co-relation 7075. Up to 1057 conditions per place. [2023-08-31 23:17:21,099 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 49 selfloop transitions, 9 changer transitions 25/88 dead transitions. [2023-08-31 23:17:21,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 447 flow [2023-08-31 23:17:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:17:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:17:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-31 23:17:21,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48980815347721823 [2023-08-31 23:17:21,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-31 23:17:21,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-31 23:17:21,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:21,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-31 23:17:21,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,109 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,109 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 817 transitions. [2023-08-31 23:17:21,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 447 flow [2023-08-31 23:17:21,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 440 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:21,123 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-08-31 23:17:21,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-31 23:17:21,124 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-31 23:17:21,125 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-08-31 23:17:21,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:21,125 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-31 23:17:21,138 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-31 23:17:21,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:21,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:21,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1289104209, now seen corresponding path program 1 times [2023-08-31 23:17:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17846573] [2023-08-31 23:17:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:21,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:21,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:21,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:21,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:17:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:21,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:17:21,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:21,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:21,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17846573] [2023-08-31 23:17:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17846573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:17:21,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539612107] [2023-08-31 23:17:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:21,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:17:21,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:21,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:17:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:17:21,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 278 [2023-08-31 23:17:21,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:21,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:21,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 278 [2023-08-31 23:17:21,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:22,041 INFO L130 PetriNetUnfolder]: 1010/1633 cut-off events. [2023-08-31 23:17:22,041 INFO L131 PetriNetUnfolder]: For 1514/1514 co-relation queries the response was YES. [2023-08-31 23:17:22,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4893 conditions, 1633 events. 1010/1633 cut-off events. For 1514/1514 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8113 event pairs, 276 based on Foata normal form. 67/1664 useless extension candidates. Maximal degree in co-relation 4884. Up to 540 conditions per place. [2023-08-31 23:17:22,051 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 59 selfloop transitions, 13 changer transitions 25/102 dead transitions. [2023-08-31 23:17:22,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 612 flow [2023-08-31 23:17:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:17:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:17:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-08-31 23:17:22,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897225077081192 [2023-08-31 23:17:22,058 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-08-31 23:17:22,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-08-31 23:17:22,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:22,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-08-31 23:17:22,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,066 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,066 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 953 transitions. [2023-08-31 23:17:22,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 612 flow [2023-08-31 23:17:22,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 102 transitions, 550 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:22,085 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-08-31 23:17:22,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-31 23:17:22,087 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:17:22,087 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-08-31 23:17:22,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:22,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:22,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:22,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:22,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:22,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1644951077, now seen corresponding path program 1 times [2023-08-31 23:17:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675760499] [2023-08-31 23:17:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:22,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:22,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:17:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:22,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:17:22,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:22,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:22,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:22,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675760499] [2023-08-31 23:17:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675760499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:22,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:17:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025335835] [2023-08-31 23:17:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:22,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:17:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:17:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:17:22,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 278 [2023-08-31 23:17:22,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:22,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:22,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 278 [2023-08-31 23:17:22,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:23,045 INFO L130 PetriNetUnfolder]: 866/1387 cut-off events. [2023-08-31 23:17:23,045 INFO L131 PetriNetUnfolder]: For 1230/1230 co-relation queries the response was YES. [2023-08-31 23:17:23,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1387 events. 866/1387 cut-off events. For 1230/1230 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6724 event pairs, 272 based on Foata normal form. 13/1376 useless extension candidates. Maximal degree in co-relation 3983. Up to 540 conditions per place. [2023-08-31 23:17:23,052 INFO L137 encePairwiseOnDemand]: 271/278 looper letters, 55 selfloop transitions, 17 changer transitions 13/90 dead transitions. [2023-08-31 23:17:23,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 552 flow [2023-08-31 23:17:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:17:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:17:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-08-31 23:17:23,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779676258992806 [2023-08-31 23:17:23,056 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-08-31 23:17:23,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-08-31 23:17:23,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:23,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-08-31 23:17:23,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 278.0) internal successors, (2502), 9 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,062 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 278.0) internal successors, (2502), 9 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,062 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1063 transitions. [2023-08-31 23:17:23,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 552 flow [2023-08-31 23:17:23,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 490 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:17:23,088 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-08-31 23:17:23,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-31 23:17:23,088 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-31 23:17:23,089 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-08-31 23:17:23,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:23,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:23,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:23,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:23,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:23,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:23,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -835816466, now seen corresponding path program 1 times [2023-08-31 23:17:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154107033] [2023-08-31 23:17:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:23,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:23,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:17:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:23,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:17:23,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:24,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:24,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154107033] [2023-08-31 23:17:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154107033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:24,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:17:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727930257] [2023-08-31 23:17:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:17:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:17:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:17:24,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 278 [2023-08-31 23:17:24,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:24,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:24,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 278 [2023-08-31 23:17:24,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:25,017 INFO L130 PetriNetUnfolder]: 855/1431 cut-off events. [2023-08-31 23:17:25,017 INFO L131 PetriNetUnfolder]: For 1697/1697 co-relation queries the response was YES. [2023-08-31 23:17:25,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 1431 events. 855/1431 cut-off events. For 1697/1697 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7478 event pairs, 7 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 3973. Up to 1043 conditions per place. [2023-08-31 23:17:25,024 INFO L137 encePairwiseOnDemand]: 273/278 looper letters, 57 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-31 23:17:25,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 473 flow [2023-08-31 23:17:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:17:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:17:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2023-08-31 23:17:25,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4136690647482014 [2023-08-31 23:17:25,028 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2023-08-31 23:17:25,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2023-08-31 23:17:25,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:25,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2023-08-31 23:17:25,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-31 23:17:25,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,033 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 6 states and 690 transitions. [2023-08-31 23:17:25,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 473 flow [2023-08-31 23:17:25,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 384 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-31 23:17:25,039 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 162 flow [2023-08-31 23:17:25,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-31 23:17:25,040 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-31 23:17:25,040 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 162 flow [2023-08-31 23:17:25,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:25,041 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] [2023-08-31 23:17:25,053 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-31 23:17:25,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:25,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:25,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1272818056, now seen corresponding path program 1 times [2023-08-31 23:17:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051431339] [2023-08-31 23:17:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:17:25,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:25,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:25,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:25,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:17:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:17:25,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:25,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:25,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:25,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051431339] [2023-08-31 23:17:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051431339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615773318] [2023-08-31 23:17:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:25,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:25,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-08-31 23:17:25,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:25,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-08-31 23:17:25,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:25,671 INFO L130 PetriNetUnfolder]: 1263/1955 cut-off events. [2023-08-31 23:17:25,671 INFO L131 PetriNetUnfolder]: For 1073/1073 co-relation queries the response was YES. [2023-08-31 23:17:25,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5292 conditions, 1955 events. 1263/1955 cut-off events. For 1073/1073 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9451 event pairs, 333 based on Foata normal form. 1/1952 useless extension candidates. Maximal degree in co-relation 5284. Up to 1161 conditions per place. [2023-08-31 23:17:25,679 INFO L137 encePairwiseOnDemand]: 275/278 looper letters, 49 selfloop transitions, 1 changer transitions 32/86 dead transitions. [2023-08-31 23:17:25,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 530 flow [2023-08-31 23:17:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-31 23:17:25,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493705035971223 [2023-08-31 23:17:25,681 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-31 23:17:25,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-31 23:17:25,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:25,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-31 23:17:25,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,685 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,686 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 162 flow. Second operand 4 states and 549 transitions. [2023-08-31 23:17:25,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 530 flow [2023-08-31 23:17:25,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 518 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:17:25,699 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 162 flow [2023-08-31 23:17:25,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-31 23:17:25,699 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-31 23:17:25,700 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 162 flow [2023-08-31 23:17:25,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:25,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:25,700 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] [2023-08-31 23:17:25,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-31 23:17:25,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:25,911 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:25,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash 87004418, now seen corresponding path program 2 times [2023-08-31 23:17:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:25,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978171285] [2023-08-31 23:17:25,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:17:25,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:25,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:25,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:25,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:17:26,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:17:26,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:26,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:17:26,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:26,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:26,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978171285] [2023-08-31 23:17:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978171285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:17:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843577476] [2023-08-31 23:17:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:26,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:17:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:26,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:17:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:17:26,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 278 [2023-08-31 23:17:26,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:26,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 278 [2023-08-31 23:17:26,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:26,396 INFO L130 PetriNetUnfolder]: 1636/2638 cut-off events. [2023-08-31 23:17:26,396 INFO L131 PetriNetUnfolder]: For 2049/2049 co-relation queries the response was YES. [2023-08-31 23:17:26,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 2638 events. 1636/2638 cut-off events. For 2049/2049 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14635 event pairs, 230 based on Foata normal form. 1/2620 useless extension candidates. Maximal degree in co-relation 7219. Up to 1266 conditions per place. [2023-08-31 23:17:26,406 INFO L137 encePairwiseOnDemand]: 275/278 looper letters, 51 selfloop transitions, 1 changer transitions 28/84 dead transitions. [2023-08-31 23:17:26,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 522 flow [2023-08-31 23:17:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:17:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:17:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-08-31 23:17:26,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919064748201439 [2023-08-31 23:17:26,409 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-08-31 23:17:26,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-08-31 23:17:26,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:26,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-08-31 23:17:26,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,413 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,414 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 162 flow. Second operand 4 states and 547 transitions. [2023-08-31 23:17:26,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 522 flow [2023-08-31 23:17:26,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 517 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:26,430 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 166 flow [2023-08-31 23:17:26,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-31 23:17:26,431 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-31 23:17:26,431 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 166 flow [2023-08-31 23:17:26,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:26,432 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] [2023-08-31 23:17:26,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:26,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:26,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:26,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:26,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1465405282, now seen corresponding path program 3 times [2023-08-31 23:17:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240202943] [2023-08-31 23:17:26,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:17:26,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:26,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:26,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:26,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:17:26,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:17:26,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:26,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:17:26,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:26,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:26,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240202943] [2023-08-31 23:17:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240202943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:26,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:26,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:17:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417679570] [2023-08-31 23:17:26,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:26,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:17:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:26,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:17:26,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:17:26,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 278 [2023-08-31 23:17:26,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:26,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:26,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 278 [2023-08-31 23:17:26,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:26,983 INFO L130 PetriNetUnfolder]: 1696/2752 cut-off events. [2023-08-31 23:17:26,984 INFO L131 PetriNetUnfolder]: For 2120/2124 co-relation queries the response was YES. [2023-08-31 23:17:26,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 2752 events. 1696/2752 cut-off events. For 2120/2124 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15286 event pairs, 668 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 7684. Up to 1411 conditions per place. [2023-08-31 23:17:26,991 INFO L137 encePairwiseOnDemand]: 275/278 looper letters, 42 selfloop transitions, 2 changer transitions 19/67 dead transitions. [2023-08-31 23:17:26,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 415 flow [2023-08-31 23:17:26,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:17:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:17:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:17:27,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49760191846522783 [2023-08-31 23:17:27,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:17:27,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:17:27,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:27,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:17:27,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,007 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 166 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:17:27,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 415 flow [2023-08-31 23:17:27,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 412 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:27,026 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 171 flow [2023-08-31 23:17:27,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-31 23:17:27,027 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-31 23:17:27,027 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 171 flow [2023-08-31 23:17:27,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:27,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, 1, 1, 1] [2023-08-31 23:17:27,046 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-31 23:17:27,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:27,246 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:27,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1717839822, now seen corresponding path program 4 times [2023-08-31 23:17:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:27,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185523446] [2023-08-31 23:17:27,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:17:27,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:27,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:27,248 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:27,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:17:27,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:17:27,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:27,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-31 23:17:27,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:27,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:27,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:27,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185523446] [2023-08-31 23:17:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185523446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:27,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:27,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:17:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990700700] [2023-08-31 23:17:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:27,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:17:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:27,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:17:27,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:17:27,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-08-31 23:17:27,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 171 flow. Second operand has 10 states, 10 states have (on average 125.4) internal successors, (1254), 10 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:27,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:27,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-08-31 23:17:27,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:28,359 INFO L130 PetriNetUnfolder]: 1471/2386 cut-off events. [2023-08-31 23:17:28,360 INFO L131 PetriNetUnfolder]: For 1727/1727 co-relation queries the response was YES. [2023-08-31 23:17:28,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 2386 events. 1471/2386 cut-off events. For 1727/1727 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12138 event pairs, 383 based on Foata normal form. 1/2369 useless extension candidates. Maximal degree in co-relation 7055. Up to 1015 conditions per place. [2023-08-31 23:17:28,368 INFO L137 encePairwiseOnDemand]: 272/278 looper letters, 63 selfloop transitions, 5 changer transitions 18/90 dead transitions. [2023-08-31 23:17:28,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 567 flow [2023-08-31 23:17:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-31 23:17:28,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48345323741007196 [2023-08-31 23:17:28,371 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-31 23:17:28,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-31 23:17:28,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:28,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-31 23:17:28,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:28,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:28,376 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:28,376 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 171 flow. Second operand 5 states and 672 transitions. [2023-08-31 23:17:28,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 567 flow [2023-08-31 23:17:28,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 557 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:28,396 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 192 flow [2023-08-31 23:17:28,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-31 23:17:28,397 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2023-08-31 23:17:28,397 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 192 flow [2023-08-31 23:17:28,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.4) internal successors, (1254), 10 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:28,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:28,398 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] [2023-08-31 23:17:28,411 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 (12)] Ended with exit code 0 [2023-08-31 23:17:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:28,608 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:28,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash 202539890, now seen corresponding path program 5 times [2023-08-31 23:17:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899363505] [2023-08-31 23:17:28,609 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:17:28,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:28,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:28,610 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:28,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:17:28,722 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:17:28,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:17:28,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-31 23:17:28,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:17:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:17:29,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:17:29,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:17:29,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899363505] [2023-08-31 23:17:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899363505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:17:29,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:17:29,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:17:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248828826] [2023-08-31 23:17:29,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:17:29,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:17:29,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:17:29,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:17:29,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:17:29,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 278 [2023-08-31 23:17:29,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 192 flow. Second operand has 10 states, 10 states have (on average 125.4) internal successors, (1254), 10 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:17:29,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 278 [2023-08-31 23:17:29,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:17:29,767 INFO L130 PetriNetUnfolder]: 1509/2479 cut-off events. [2023-08-31 23:17:29,768 INFO L131 PetriNetUnfolder]: For 2800/2811 co-relation queries the response was YES. [2023-08-31 23:17:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 2479 events. 1509/2479 cut-off events. For 2800/2811 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13110 event pairs, 443 based on Foata normal form. 6/2454 useless extension candidates. Maximal degree in co-relation 8126. Up to 931 conditions per place. [2023-08-31 23:17:29,776 INFO L137 encePairwiseOnDemand]: 273/278 looper letters, 49 selfloop transitions, 3 changer transitions 34/90 dead transitions. [2023-08-31 23:17:29,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 585 flow [2023-08-31 23:17:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:17:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:17:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-31 23:17:29,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48345323741007196 [2023-08-31 23:17:29,779 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-31 23:17:29,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-31 23:17:29,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:17:29,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-31 23:17:29,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 278.0) internal successors, (1668), 6 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,784 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 192 flow. Second operand 5 states and 672 transitions. [2023-08-31 23:17:29,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 585 flow [2023-08-31 23:17:29,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 581 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:17:29,809 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 185 flow [2023-08-31 23:17:29,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-08-31 23:17:29,809 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-31 23:17:29,809 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 185 flow [2023-08-31 23:17:29,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.4) internal successors, (1254), 10 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:17:29,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:17:29,810 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] [2023-08-31 23:17:29,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:30,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:30,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:17:30,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:17:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1138128382, now seen corresponding path program 6 times [2023-08-31 23:17:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:17:30,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654693583] [2023-08-31 23:17:30,018 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 23:17:30,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:30,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:17:30,019 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:17:30,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 23:17:30,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-31 23:17:30,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:17:30,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:17:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:17:30,300 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:17:30,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:17:30,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:17:30,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:17:30,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:17:30,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:17:30,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:17:30,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:17:30,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:17:30,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:17:30,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:17:30,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:17:30,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-31 23:17:30,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:17:30,515 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:17:30,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:17:30,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:17:30,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:17:30 BasicIcfg [2023-08-31 23:17:30,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:17:30,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:17:30,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:17:30,601 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:17:30,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:17:06" (3/4) ... [2023-08-31 23:17:30,604 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:17:30,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:17:30,605 INFO L158 Benchmark]: Toolchain (without parser) took 25910.64ms. Allocated memory was 71.3MB in the beginning and 895.5MB in the end (delta: 824.2MB). Free memory was 43.2MB in the beginning and 615.2MB in the end (delta: -572.0MB). Peak memory consumption was 251.4MB. Max. memory is 16.1GB. [2023-08-31 23:17:30,605 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:30,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.60ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 36.0MB in the end (delta: 6.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-08-31 23:17:30,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.08ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 33.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:30,606 INFO L158 Benchmark]: Boogie Preprocessor took 66.85ms. Allocated memory is still 71.3MB. Free memory was 33.3MB in the beginning and 31.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:17:30,606 INFO L158 Benchmark]: RCFGBuilder took 836.04ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 31.0MB in the beginning and 66.0MB in the end (delta: -35.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-08-31 23:17:30,607 INFO L158 Benchmark]: TraceAbstraction took 24420.69ms. Allocated memory was 90.2MB in the beginning and 895.5MB in the end (delta: 805.3MB). Free memory was 65.6MB in the beginning and 615.2MB in the end (delta: -549.7MB). Peak memory consumption was 254.5MB. Max. memory is 16.1GB. [2023-08-31 23:17:30,607 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 895.5MB. Free memory is still 615.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:17:30,609 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 was 32.7MB in the beginning and 32.6MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.60ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 36.0MB in the end (delta: 6.9MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.08ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 33.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.85ms. Allocated memory is still 71.3MB. Free memory was 33.3MB in the beginning and 31.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 836.04ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 31.0MB in the beginning and 66.0MB in the end (delta: -35.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24420.69ms. Allocated memory was 90.2MB in the beginning and 895.5MB in the end (delta: 805.3MB). Free memory was 65.6MB in the beginning and 615.2MB in the end (delta: -549.7MB). Peak memory consumption was 254.5MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 895.5MB. Free memory is still 615.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 150 PlacesBefore, 52 PlacesAfterwards, 139 TransitionsBefore, 39 TransitionsAfterwards, 3506 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 11176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4511, independent: 4226, independent conditional: 0, independent unconditional: 4226, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1839, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4511, independent: 2441, independent conditional: 0, independent unconditional: 2441, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 1839, unknown conditional: 0, unknown unconditional: 1839] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-1, t737={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=0, t737={3:0}, t738={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=1, t737={3:0}, t738={7:0}, t739={16777216:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=2, t737={3:0}, t738={7:0}, t739={16777216:0}, t740={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t737={3:0}, t738={7:0}, t739={16777216:0}, t740={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 858]: 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: 856]: 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: 854]: 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, 180 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: 24.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2264 IncrementalHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 29 mSDtfsCounter, 2264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 230 ConstructedInterpolants, 20 QuantifiedInterpolants, 2626 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1953 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:17:30,629 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