./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix013.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:16:48,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:16:48,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:16:48,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:16:48,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:16:48,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:16:48,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:16:48,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:16:48,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:16:48,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:16:48,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:16:48,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:16:48,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:16:48,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:16:48,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:16:48,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:16:48,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:16:48,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:16:48,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:16:48,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:16:48,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:16:48,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:16:48,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:16:48,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:16:48,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:16:48,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:16:48,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:16:48,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:16:48,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:16:48,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:16:48,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:16:48,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:16:48,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:16:48,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:16:48,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:16:48,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:16:48,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:16:48,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:16:48,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:16:48,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:16:48,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:16:48,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:16:48,900 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:16:48,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:16:48,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:16:48,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:16:48,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:16:48,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:16:48,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:16:48,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:16:48,904 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:16:48,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:16:48,905 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:16:48,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:16:48,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:16:48,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:16:48,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:16:48,906 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:16:48,906 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:16:48,906 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:16:48,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:16:48,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:16:48,907 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:16:48,907 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:16:48,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:16:48,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:16:48,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:16:48,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:16:48,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:16:48,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:16:48,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:16:48,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:16:48,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:16:48,909 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:16:48,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:16:48,910 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:16:48,910 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 -> 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 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 -> AFTER [2023-08-29 20:16:49,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:16:49,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:16:49,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:16:49,252 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:16:49,252 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:16:49,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-08-29 20:16:50,298 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:16:50,600 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:16:50,601 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-08-29 20:16:50,614 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d98d150/2463942ddc3b4b888fb853b52a909f3a/FLAGb20bd005f [2023-08-29 20:16:50,628 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d98d150/2463942ddc3b4b888fb853b52a909f3a [2023-08-29 20:16:50,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:16:50,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:16:50,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:16:50,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:16:50,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:16:50,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:50" (1/1) ... [2023-08-29 20:16:50,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d066e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:50, skipping insertion in model container [2023-08-29 20:16:50,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:50" (1/1) ... [2023-08-29 20:16:50,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:16:50,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:16:50,877 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/mix013.oepc.i[945,958] [2023-08-29 20:16:51,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:16:51,121 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:16:51,134 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/mix013.oepc.i[945,958] [2023-08-29 20:16:51,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:16:51,236 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:16:51,237 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:16:51,242 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:16:51,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51 WrapperNode [2023-08-29 20:16:51,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:16:51,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:16:51,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:16:51,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:16:51,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,309 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-29 20:16:51,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:16:51,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:16:51,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:16:51,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:16:51,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:16:51,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:16:51,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:16:51,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:16:51,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (1/1) ... [2023-08-29 20:16:51,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:16:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:16:51,410 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-29 20:16:51,423 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-29 20:16:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:16:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:16:51,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:16:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:16:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:16:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:16:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:16:51,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:16:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:16:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:16:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:16:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:16:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:16:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:16:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:16:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:16:51,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:16:51,453 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:16:51,659 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:16:51,661 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:16:52,005 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:16:52,190 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:16:52,191 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:16:52,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:52 BoogieIcfgContainer [2023-08-29 20:16:52,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:16:52,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:16:52,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:16:52,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:16:52,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:16:50" (1/3) ... [2023-08-29 20:16:52,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ecba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:52, skipping insertion in model container [2023-08-29 20:16:52,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:51" (2/3) ... [2023-08-29 20:16:52,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ecba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:52, skipping insertion in model container [2023-08-29 20:16:52,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:52" (3/3) ... [2023-08-29 20:16:52,207 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2023-08-29 20:16:52,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:16:52,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:16:52,222 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:16:52,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:16:52,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:16:52,369 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:16:52,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:16:52,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:16:52,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-29 20:16:52,399 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:16:52,412 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:16:52,420 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:16:52,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-29 20:16:52,459 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:16:52,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:52,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:16:52,463 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-08-29 20:16:56,978 INFO L134 LiptonReduction]: Checked pairs total: 10751 [2023-08-29 20:16:56,978 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-29 20:16:56,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:16:56,996 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;@323e0eca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:16:56,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:16:56,997 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:16:56,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:56,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:57,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:16:57,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:16:57,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2023-08-29 20:16:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441772123] [2023-08-29 20:16:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:57,124 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-29 20:16:57,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:57,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441772123] [2023-08-29 20:16:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441772123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:57,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:57,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:16:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152020267] [2023-08-29 20:16:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:16:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:57,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:16:57,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:16:57,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 283 [2023-08-29 20:16:57,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:57,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:57,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 283 [2023-08-29 20:16:57,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:58,880 INFO L130 PetriNetUnfolder]: 9959/13448 cut-off events. [2023-08-29 20:16:58,881 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-29 20:16:58,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27036 conditions, 13448 events. 9959/13448 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 72618 event pairs, 9959 based on Foata normal form. 400/11815 useless extension candidates. Maximal degree in co-relation 27024. Up to 13371 conditions per place. [2023-08-29 20:16:58,973 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 29 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2023-08-29 20:16:58,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 138 flow [2023-08-29 20:16:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:16:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:16:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2023-08-29 20:16:58,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300353356890459 [2023-08-29 20:16:58,985 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 300 transitions. [2023-08-29 20:16:58,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 300 transitions. [2023-08-29 20:16:58,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:58,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 300 transitions. [2023-08-29 20:16:58,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:58,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:58,997 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:58,998 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 300 transitions. [2023-08-29 20:16:58,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 138 flow [2023-08-29 20:16:59,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:16:59,006 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-29 20:16:59,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-29 20:16:59,010 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-29 20:16:59,010 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-29 20:16:59,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:59,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:59,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:16:59,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:16:59,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:16:59,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 605366, now seen corresponding path program 1 times [2023-08-29 20:16:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:16:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796046587] [2023-08-29 20:16:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:16:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:59,259 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-29 20:16:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:16:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796046587] [2023-08-29 20:16:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796046587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:16:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111088595] [2023-08-29 20:16:59,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:59,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:16:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:16:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:16:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:16:59,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-29 20:16:59,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:59,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:59,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-29 20:16:59,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:00,334 INFO L130 PetriNetUnfolder]: 7831/11258 cut-off events. [2023-08-29 20:17:00,335 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:17:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21991 conditions, 11258 events. 7831/11258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 71801 event pairs, 1447 based on Foata normal form. 0/10267 useless extension candidates. Maximal degree in co-relation 21988. Up to 8431 conditions per place. [2023-08-29 20:17:00,395 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 45 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2023-08-29 20:17:00,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 228 flow [2023-08-29 20:17:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:17:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:17:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-08-29 20:17:00,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206124852767963 [2023-08-29 20:17:00,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-08-29 20:17:00,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-08-29 20:17:00,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:00,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-08-29 20:17:00,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:00,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:00,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:00,404 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 442 transitions. [2023-08-29 20:17:00,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 228 flow [2023-08-29 20:17:00,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:17:00,406 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 74 flow [2023-08-29 20:17:00,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-29 20:17:00,407 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-29 20:17:00,407 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 74 flow [2023-08-29 20:17:00,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:00,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:00,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:00,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:17:00,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:00,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash -969939821, now seen corresponding path program 1 times [2023-08-29 20:17:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752101496] [2023-08-29 20:17:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:00,876 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-29 20:17:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:00,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752101496] [2023-08-29 20:17:00,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752101496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:00,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:00,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:17:00,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403776376] [2023-08-29 20:17:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:00,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:17:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:00,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:17:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:17:00,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-08-29 20:17:00,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:00,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:00,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-08-29 20:17:00,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:03,165 INFO L130 PetriNetUnfolder]: 20389/27028 cut-off events. [2023-08-29 20:17:03,165 INFO L131 PetriNetUnfolder]: For 1317/1317 co-relation queries the response was YES. [2023-08-29 20:17:03,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55751 conditions, 27028 events. 20389/27028 cut-off events. For 1317/1317 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 131847 event pairs, 8983 based on Foata normal form. 0/26144 useless extension candidates. Maximal degree in co-relation 55747. Up to 19157 conditions per place. [2023-08-29 20:17:03,314 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 65 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2023-08-29 20:17:03,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 328 flow [2023-08-29 20:17:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:17:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:17:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-29 20:17:03,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756183745583039 [2023-08-29 20:17:03,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-29 20:17:03,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-29 20:17:03,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:03,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-29 20:17:03,320 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-29 20:17:03,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,324 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,324 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 74 flow. Second operand 5 states and 673 transitions. [2023-08-29 20:17:03,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 328 flow [2023-08-29 20:17:03,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:17:03,327 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 158 flow [2023-08-29 20:17:03,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-29 20:17:03,328 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2023-08-29 20:17:03,328 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 158 flow [2023-08-29 20:17:03,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:03,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:03,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:03,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:17:03,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:03,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash -969939763, now seen corresponding path program 1 times [2023-08-29 20:17:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807322146] [2023-08-29 20:17:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:03,872 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-29 20:17:03,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807322146] [2023-08-29 20:17:03,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807322146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:03,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:03,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:17:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103222785] [2023-08-29 20:17:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:03,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:17:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:17:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:17:04,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-29 20:17:04,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:04,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:04,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-29 20:17:04,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:05,901 INFO L130 PetriNetUnfolder]: 16895/24169 cut-off events. [2023-08-29 20:17:05,901 INFO L131 PetriNetUnfolder]: For 9641/9943 co-relation queries the response was YES. [2023-08-29 20:17:05,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55876 conditions, 24169 events. 16895/24169 cut-off events. For 9641/9943 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 153495 event pairs, 5310 based on Foata normal form. 1256/24738 useless extension candidates. Maximal degree in co-relation 55869. Up to 9019 conditions per place. [2023-08-29 20:17:06,062 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 71 selfloop transitions, 10 changer transitions 5/93 dead transitions. [2023-08-29 20:17:06,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 460 flow [2023-08-29 20:17:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:17:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:17:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2023-08-29 20:17:06,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396769308430086 [2023-08-29 20:17:06,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2023-08-29 20:17:06,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2023-08-29 20:17:06,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:06,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2023-08-29 20:17:06,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,077 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,077 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 158 flow. Second operand 7 states and 871 transitions. [2023-08-29 20:17:06,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 460 flow [2023-08-29 20:17:06,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:17:06,098 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 185 flow [2023-08-29 20:17:06,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-29 20:17:06,099 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-29 20:17:06,100 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 185 flow [2023-08-29 20:17:06,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:06,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:06,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:17:06,101 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:06,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2031273068, now seen corresponding path program 1 times [2023-08-29 20:17:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60886354] [2023-08-29 20:17:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:06,350 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-29 20:17:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60886354] [2023-08-29 20:17:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60886354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:17:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645650057] [2023-08-29 20:17:06,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:06,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:17:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:17:06,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:17:06,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-08-29 20:17:06,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:06,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:06,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-08-29 20:17:06,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:09,160 INFO L130 PetriNetUnfolder]: 26430/35453 cut-off events. [2023-08-29 20:17:09,160 INFO L131 PetriNetUnfolder]: For 29591/29591 co-relation queries the response was YES. [2023-08-29 20:17:09,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90881 conditions, 35453 events. 26430/35453 cut-off events. For 29591/29591 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 185299 event pairs, 5984 based on Foata normal form. 1452/36905 useless extension candidates. Maximal degree in co-relation 90869. Up to 20501 conditions per place. [2023-08-29 20:17:09,348 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 80 selfloop transitions, 6 changer transitions 4/90 dead transitions. [2023-08-29 20:17:09,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 531 flow [2023-08-29 20:17:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:17:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:17:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-29 20:17:09,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784452296819788 [2023-08-29 20:17:09,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-29 20:17:09,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-29 20:17:09,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:09,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-29 20:17:09,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:09,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:09,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:09,358 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 185 flow. Second operand 5 states and 677 transitions. [2023-08-29 20:17:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 531 flow [2023-08-29 20:17:09,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 507 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:17:09,928 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 214 flow [2023-08-29 20:17:09,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-08-29 20:17:09,930 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-29 20:17:09,931 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 214 flow [2023-08-29 20:17:09,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:09,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:09,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:17:09,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:09,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash 939250500, now seen corresponding path program 1 times [2023-08-29 20:17:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:09,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840411282] [2023-08-29 20:17:09,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:10,445 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-29 20:17:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840411282] [2023-08-29 20:17:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840411282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:17:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448974204] [2023-08-29 20:17:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:10,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:17:10,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:17:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:17:10,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-29 20:17:10,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:10,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:10,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-29 20:17:10,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:12,229 INFO L130 PetriNetUnfolder]: 15629/21901 cut-off events. [2023-08-29 20:17:12,230 INFO L131 PetriNetUnfolder]: For 19848/20180 co-relation queries the response was YES. [2023-08-29 20:17:12,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54533 conditions, 21901 events. 15629/21901 cut-off events. For 19848/20180 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 130209 event pairs, 3411 based on Foata normal form. 762/22212 useless extension candidates. Maximal degree in co-relation 54520. Up to 15457 conditions per place. [2023-08-29 20:17:12,372 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 50 selfloop transitions, 8 changer transitions 2/71 dead transitions. [2023-08-29 20:17:12,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 372 flow [2023-08-29 20:17:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:17:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:17:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-08-29 20:17:12,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-29 20:17:12,376 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-08-29 20:17:12,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-08-29 20:17:12,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:12,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-08-29 20:17:12,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:12,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:12,381 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:12,381 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 214 flow. Second operand 7 states and 849 transitions. [2023-08-29 20:17:12,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 372 flow [2023-08-29 20:17:12,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:17:12,434 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 181 flow [2023-08-29 20:17:12,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-08-29 20:17:12,435 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-29 20:17:12,435 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 181 flow [2023-08-29 20:17:12,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:12,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:12,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:12,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:17:12,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:12,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2040498989, now seen corresponding path program 1 times [2023-08-29 20:17:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:12,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921803333] [2023-08-29 20:17:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:12,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:12,599 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-29 20:17:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921803333] [2023-08-29 20:17:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921803333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:17:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978246043] [2023-08-29 20:17:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:12,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:17:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:17:12,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:17:12,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-08-29 20:17:12,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:12,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:12,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-08-29 20:17:12,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:14,439 INFO L130 PetriNetUnfolder]: 20592/27763 cut-off events. [2023-08-29 20:17:14,439 INFO L131 PetriNetUnfolder]: For 23495/23495 co-relation queries the response was YES. [2023-08-29 20:17:14,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71347 conditions, 27763 events. 20592/27763 cut-off events. For 23495/23495 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 144112 event pairs, 7500 based on Foata normal form. 600/28363 useless extension candidates. Maximal degree in co-relation 71336. Up to 22038 conditions per place. [2023-08-29 20:17:14,597 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 50 selfloop transitions, 7 changer transitions 28/85 dead transitions. [2023-08-29 20:17:14,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 487 flow [2023-08-29 20:17:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:17:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:17:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-29 20:17:14,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763250883392226 [2023-08-29 20:17:14,600 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-29 20:17:14,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-29 20:17:14,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:14,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-29 20:17:14,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:14,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:14,605 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:14,605 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 181 flow. Second operand 5 states and 674 transitions. [2023-08-29 20:17:14,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 487 flow [2023-08-29 20:17:14,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 464 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-29 20:17:14,946 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 187 flow [2023-08-29 20:17:14,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2023-08-29 20:17:14,947 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-29 20:17:14,947 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 187 flow [2023-08-29 20:17:14,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:14,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:14,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:14,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:17:14,948 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:14,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1476803426, now seen corresponding path program 1 times [2023-08-29 20:17:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339607929] [2023-08-29 20:17:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:15,147 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-29 20:17:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339607929] [2023-08-29 20:17:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339607929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:15,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:15,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:17:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309768561] [2023-08-29 20:17:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:15,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:17:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:15,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:17:15,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:17:15,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-29 20:17:15,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:15,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:15,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-29 20:17:15,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:16,323 INFO L130 PetriNetUnfolder]: 8847/13072 cut-off events. [2023-08-29 20:17:16,323 INFO L131 PetriNetUnfolder]: For 3777/3973 co-relation queries the response was YES. [2023-08-29 20:17:16,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29939 conditions, 13072 events. 8847/13072 cut-off events. For 3777/3973 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 81477 event pairs, 1804 based on Foata normal form. 899/13785 useless extension candidates. Maximal degree in co-relation 29927. Up to 8713 conditions per place. [2023-08-29 20:17:16,395 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 65 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2023-08-29 20:17:16,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 452 flow [2023-08-29 20:17:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:17:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:17:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-08-29 20:17:16,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49328621908127207 [2023-08-29 20:17:16,397 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-08-29 20:17:16,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-08-29 20:17:16,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:16,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-08-29 20:17:16,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:16,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:16,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:16,402 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 187 flow. Second operand 5 states and 698 transitions. [2023-08-29 20:17:16,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 452 flow [2023-08-29 20:17:16,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 434 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:17:16,460 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 244 flow [2023-08-29 20:17:16,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-29 20:17:16,461 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-29 20:17:16,461 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 244 flow [2023-08-29 20:17:16,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:16,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:16,462 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-29 20:17:16,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:17:16,462 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:16,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 249129037, now seen corresponding path program 1 times [2023-08-29 20:17:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:16,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876860172] [2023-08-29 20:17:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:16,636 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-29 20:17:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876860172] [2023-08-29 20:17:16,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876860172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:16,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:16,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:17:16,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444416110] [2023-08-29 20:17:16,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:16,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:17:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:16,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:17:16,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:17:16,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-29 20:17:16,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:16,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:16,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-29 20:17:16,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:17,703 INFO L130 PetriNetUnfolder]: 6427/9955 cut-off events. [2023-08-29 20:17:17,704 INFO L131 PetriNetUnfolder]: For 5111/5200 co-relation queries the response was YES. [2023-08-29 20:17:17,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28552 conditions, 9955 events. 6427/9955 cut-off events. For 5111/5200 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 65158 event pairs, 940 based on Foata normal form. 592/10393 useless extension candidates. Maximal degree in co-relation 28539. Up to 3181 conditions per place. [2023-08-29 20:17:17,770 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 88 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2023-08-29 20:17:17,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 120 transitions, 680 flow [2023-08-29 20:17:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:17:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:17:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 979 transitions. [2023-08-29 20:17:17,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49419485108531047 [2023-08-29 20:17:17,774 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 979 transitions. [2023-08-29 20:17:17,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 979 transitions. [2023-08-29 20:17:17,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:17,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 979 transitions. [2023-08-29 20:17:17,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:17,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:17,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:17,781 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 244 flow. Second operand 7 states and 979 transitions. [2023-08-29 20:17:17,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 120 transitions, 680 flow [2023-08-29 20:17:17,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:17:17,839 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 373 flow [2023-08-29 20:17:17,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=373, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-08-29 20:17:17,839 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-29 20:17:17,839 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 373 flow [2023-08-29 20:17:17,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:17,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:17,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:17,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:17:17,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:17,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash 874228212, now seen corresponding path program 1 times [2023-08-29 20:17:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962710640] [2023-08-29 20:17:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962710640] [2023-08-29 20:17:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962710640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:17:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690935865] [2023-08-29 20:17:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:18,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:17:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:18,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:17:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:17:18,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-29 20:17:18,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:18,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:18,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-29 20:17:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:19,313 INFO L130 PetriNetUnfolder]: 5634/8777 cut-off events. [2023-08-29 20:17:19,313 INFO L131 PetriNetUnfolder]: For 12011/12076 co-relation queries the response was YES. [2023-08-29 20:17:19,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29601 conditions, 8777 events. 5634/8777 cut-off events. For 12011/12076 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 57184 event pairs, 772 based on Foata normal form. 204/8831 useless extension candidates. Maximal degree in co-relation 29585. Up to 2940 conditions per place. [2023-08-29 20:17:19,372 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 98 selfloop transitions, 28 changer transitions 10/149 dead transitions. [2023-08-29 20:17:19,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 149 transitions, 961 flow [2023-08-29 20:17:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:17:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:17:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1258 transitions. [2023-08-29 20:17:19,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4939144091087554 [2023-08-29 20:17:19,377 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1258 transitions. [2023-08-29 20:17:19,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1258 transitions. [2023-08-29 20:17:19,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:19,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1258 transitions. [2023-08-29 20:17:19,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.77777777777777) internal successors, (1258), 9 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:19,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:19,385 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:19,385 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 373 flow. Second operand 9 states and 1258 transitions. [2023-08-29 20:17:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 149 transitions, 961 flow [2023-08-29 20:17:19,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 149 transitions, 911 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-29 20:17:19,902 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 501 flow [2023-08-29 20:17:19,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=501, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2023-08-29 20:17:19,903 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2023-08-29 20:17:19,903 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 501 flow [2023-08-29 20:17:19,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:19,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:19,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:19,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:17:19,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:19,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1860413953, now seen corresponding path program 1 times [2023-08-29 20:17:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035681272] [2023-08-29 20:17:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:20,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035681272] [2023-08-29 20:17:20,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035681272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:17:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798739389] [2023-08-29 20:17:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:20,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:17:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:17:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:17:20,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-29 20:17:20,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 501 flow. Second operand has 8 states, 8 states have (on average 127.75) internal successors, (1022), 8 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:20,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:20,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-29 20:17:20,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:22,432 INFO L130 PetriNetUnfolder]: 9048/14439 cut-off events. [2023-08-29 20:17:22,432 INFO L131 PetriNetUnfolder]: For 35166/35441 co-relation queries the response was YES. [2023-08-29 20:17:22,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51929 conditions, 14439 events. 9048/14439 cut-off events. For 35166/35441 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 107114 event pairs, 1201 based on Foata normal form. 21/14148 useless extension candidates. Maximal degree in co-relation 51910. Up to 4356 conditions per place. [2023-08-29 20:17:22,540 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 199 selfloop transitions, 6 changer transitions 21/239 dead transitions. [2023-08-29 20:17:22,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 239 transitions, 2332 flow [2023-08-29 20:17:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:17:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:17:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2023-08-29 20:17:22,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4936900555275114 [2023-08-29 20:17:22,543 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2023-08-29 20:17:22,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2023-08-29 20:17:22,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:22,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2023-08-29 20:17:22,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:22,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:22,549 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:22,549 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 501 flow. Second operand 7 states and 978 transitions. [2023-08-29 20:17:22,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 239 transitions, 2332 flow [2023-08-29 20:17:23,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 239 transitions, 1895 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-08-29 20:17:23,849 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 455 flow [2023-08-29 20:17:23,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2023-08-29 20:17:23,849 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2023-08-29 20:17:23,849 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 455 flow [2023-08-29 20:17:23,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.75) internal successors, (1022), 8 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:23,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:23,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:23,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:17:23,850 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:23,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 693255105, now seen corresponding path program 2 times [2023-08-29 20:17:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:23,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125309660] [2023-08-29 20:17:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:24,390 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-29 20:17:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125309660] [2023-08-29 20:17:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125309660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:17:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270988271] [2023-08-29 20:17:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:24,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:17:24,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:17:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:17:24,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 283 [2023-08-29 20:17:24,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 455 flow. Second operand has 9 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:24,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:24,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 283 [2023-08-29 20:17:24,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:27,503 INFO L130 PetriNetUnfolder]: 25758/37882 cut-off events. [2023-08-29 20:17:27,503 INFO L131 PetriNetUnfolder]: For 69420/69420 co-relation queries the response was YES. [2023-08-29 20:17:27,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137555 conditions, 37882 events. 25758/37882 cut-off events. For 69420/69420 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 250500 event pairs, 10370 based on Foata normal form. 50/37932 useless extension candidates. Maximal degree in co-relation 137531. Up to 22955 conditions per place. [2023-08-29 20:17:27,860 INFO L137 encePairwiseOnDemand]: 269/283 looper letters, 112 selfloop transitions, 33 changer transitions 118/263 dead transitions. [2023-08-29 20:17:27,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 263 transitions, 1997 flow [2023-08-29 20:17:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:17:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:17:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1556 transitions. [2023-08-29 20:17:27,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581861012956419 [2023-08-29 20:17:27,864 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1556 transitions. [2023-08-29 20:17:27,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1556 transitions. [2023-08-29 20:17:27,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:27,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1556 transitions. [2023-08-29 20:17:27,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 129.66666666666666) internal successors, (1556), 12 states have internal predecessors, (1556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:27,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 283.0) internal successors, (3679), 13 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:27,873 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 283.0) internal successors, (3679), 13 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:27,873 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 455 flow. Second operand 12 states and 1556 transitions. [2023-08-29 20:17:27,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 263 transitions, 1997 flow [2023-08-29 20:17:33,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 263 transitions, 1983 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:17:33,105 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 582 flow [2023-08-29 20:17:33,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=582, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2023-08-29 20:17:33,106 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2023-08-29 20:17:33,106 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 582 flow [2023-08-29 20:17:33,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:33,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:33,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:33,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:17:33,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:33,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash -871943847, now seen corresponding path program 3 times [2023-08-29 20:17:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:33,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386391034] [2023-08-29 20:17:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:17:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386391034] [2023-08-29 20:17:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386391034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:17:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859345939] [2023-08-29 20:17:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:33,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:17:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:17:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:17:33,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 283 [2023-08-29 20:17:33,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:33,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:33,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 283 [2023-08-29 20:17:33,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:34,781 INFO L130 PetriNetUnfolder]: 10254/15541 cut-off events. [2023-08-29 20:17:34,781 INFO L131 PetriNetUnfolder]: For 34587/34587 co-relation queries the response was YES. [2023-08-29 20:17:34,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61391 conditions, 15541 events. 10254/15541 cut-off events. For 34587/34587 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 94755 event pairs, 3871 based on Foata normal form. 52/15593 useless extension candidates. Maximal degree in co-relation 61361. Up to 8676 conditions per place. [2023-08-29 20:17:34,884 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 104 selfloop transitions, 26 changer transitions 55/185 dead transitions. [2023-08-29 20:17:34,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 185 transitions, 1594 flow [2023-08-29 20:17:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:17:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:17:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 928 transitions. [2023-08-29 20:17:34,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4684502776375568 [2023-08-29 20:17:34,886 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 928 transitions. [2023-08-29 20:17:34,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 928 transitions. [2023-08-29 20:17:34,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:34,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 928 transitions. [2023-08-29 20:17:34,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.57142857142858) internal successors, (928), 7 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:34,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:34,891 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:34,892 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 582 flow. Second operand 7 states and 928 transitions. [2023-08-29 20:17:34,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 185 transitions, 1594 flow [2023-08-29 20:17:35,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 185 transitions, 1480 flow, removed 46 selfloop flow, removed 8 redundant places. [2023-08-29 20:17:35,532 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 626 flow [2023-08-29 20:17:35,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=626, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-29 20:17:35,532 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2023-08-29 20:17:35,533 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 626 flow [2023-08-29 20:17:35,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:35,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:35,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:35,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:17:35,534 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:35,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1485308789, now seen corresponding path program 4 times [2023-08-29 20:17:35,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:35,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885735545] [2023-08-29 20:17:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:35,819 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-29 20:17:35,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885735545] [2023-08-29 20:17:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885735545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:35,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:17:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624921540] [2023-08-29 20:17:35,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:35,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:17:35,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:35,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:17:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:17:35,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-29 20:17:35,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 626 flow. Second operand has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:35,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:35,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-29 20:17:35,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:36,905 INFO L130 PetriNetUnfolder]: 5845/9399 cut-off events. [2023-08-29 20:17:36,905 INFO L131 PetriNetUnfolder]: For 19586/19778 co-relation queries the response was YES. [2023-08-29 20:17:36,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35973 conditions, 9399 events. 5845/9399 cut-off events. For 19586/19778 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 66420 event pairs, 1179 based on Foata normal form. 163/9296 useless extension candidates. Maximal degree in co-relation 35946. Up to 3615 conditions per place. [2023-08-29 20:17:36,958 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 72 selfloop transitions, 18 changer transitions 52/154 dead transitions. [2023-08-29 20:17:36,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 154 transitions, 1255 flow [2023-08-29 20:17:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:17:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:17:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1092 transitions. [2023-08-29 20:17:36,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823321554770318 [2023-08-29 20:17:36,960 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1092 transitions. [2023-08-29 20:17:36,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1092 transitions. [2023-08-29 20:17:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:36,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1092 transitions. [2023-08-29 20:17:36,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.5) internal successors, (1092), 8 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:36,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:36,965 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:36,966 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 626 flow. Second operand 8 states and 1092 transitions. [2023-08-29 20:17:36,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 154 transitions, 1255 flow [2023-08-29 20:17:37,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 154 transitions, 1197 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-29 20:17:37,431 INFO L231 Difference]: Finished difference. Result has 93 places, 59 transitions, 412 flow [2023-08-29 20:17:37,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=412, PETRI_PLACES=93, PETRI_TRANSITIONS=59} [2023-08-29 20:17:37,431 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 38 predicate places. [2023-08-29 20:17:37,431 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 59 transitions, 412 flow [2023-08-29 20:17:37,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:37,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:37,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, 1, 1] [2023-08-29 20:17:37,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:17:37,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:37,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 673724624, now seen corresponding path program 1 times [2023-08-29 20:17:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759773026] [2023-08-29 20:17:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:37,687 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-29 20:17:37,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759773026] [2023-08-29 20:17:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759773026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:37,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:37,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:17:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9147240] [2023-08-29 20:17:37,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:17:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:17:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:17:37,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-29 20:17:37,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 59 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:37,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:37,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-29 20:17:37,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:38,406 INFO L130 PetriNetUnfolder]: 4369/7265 cut-off events. [2023-08-29 20:17:38,407 INFO L131 PetriNetUnfolder]: For 18973/19069 co-relation queries the response was YES. [2023-08-29 20:17:38,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29253 conditions, 7265 events. 4369/7265 cut-off events. For 18973/19069 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 48573 event pairs, 730 based on Foata normal form. 4/7178 useless extension candidates. Maximal degree in co-relation 29225. Up to 3183 conditions per place. [2023-08-29 20:17:38,450 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 74 selfloop transitions, 2 changer transitions 28/115 dead transitions. [2023-08-29 20:17:38,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 115 transitions, 1022 flow [2023-08-29 20:17:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:17:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:17:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-29 20:17:38,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48551236749116605 [2023-08-29 20:17:38,452 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-29 20:17:38,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-29 20:17:38,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:38,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-29 20:17:38,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:38,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:38,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:38,456 INFO L175 Difference]: Start difference. First operand has 93 places, 59 transitions, 412 flow. Second operand 5 states and 687 transitions. [2023-08-29 20:17:38,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 115 transitions, 1022 flow [2023-08-29 20:17:38,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 115 transitions, 842 flow, removed 46 selfloop flow, removed 12 redundant places. [2023-08-29 20:17:38,615 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 333 flow [2023-08-29 20:17:38,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2023-08-29 20:17:38,616 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 26 predicate places. [2023-08-29 20:17:38,616 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 333 flow [2023-08-29 20:17:38,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:38,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:38,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:38,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:17:38,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:38,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1310078564, now seen corresponding path program 2 times [2023-08-29 20:17:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:38,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807681838] [2023-08-29 20:17:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:38,922 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-29 20:17:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807681838] [2023-08-29 20:17:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807681838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:17:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506422979] [2023-08-29 20:17:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:38,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:17:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:17:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:17:38,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 283 [2023-08-29 20:17:38,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:38,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:38,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 283 [2023-08-29 20:17:38,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:39,909 INFO L130 PetriNetUnfolder]: 7101/11300 cut-off events. [2023-08-29 20:17:39,909 INFO L131 PetriNetUnfolder]: For 21884/21884 co-relation queries the response was YES. [2023-08-29 20:17:39,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42867 conditions, 11300 events. 7101/11300 cut-off events. For 21884/21884 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 72689 event pairs, 1485 based on Foata normal form. 4/11304 useless extension candidates. Maximal degree in co-relation 42843. Up to 5812 conditions per place. [2023-08-29 20:17:39,966 INFO L137 encePairwiseOnDemand]: 273/283 looper letters, 82 selfloop transitions, 10 changer transitions 40/132 dead transitions. [2023-08-29 20:17:39,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 132 transitions, 1022 flow [2023-08-29 20:17:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:17:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:17:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2023-08-29 20:17:39,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581861012956419 [2023-08-29 20:17:39,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2023-08-29 20:17:39,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2023-08-29 20:17:39,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:39,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2023-08-29 20:17:39,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:39,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:39,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:39,972 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 333 flow. Second operand 6 states and 778 transitions. [2023-08-29 20:17:39,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 132 transitions, 1022 flow [2023-08-29 20:17:40,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 132 transitions, 1016 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:17:40,289 INFO L231 Difference]: Finished difference. Result has 86 places, 57 transitions, 358 flow [2023-08-29 20:17:40,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=86, PETRI_TRANSITIONS=57} [2023-08-29 20:17:40,290 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 31 predicate places. [2023-08-29 20:17:40,290 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 57 transitions, 358 flow [2023-08-29 20:17:40,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:40,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:40,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:40,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:17:40,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:40,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 218127078, now seen corresponding path program 3 times [2023-08-29 20:17:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845909051] [2023-08-29 20:17:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:40,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:41,113 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-29 20:17:41,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845909051] [2023-08-29 20:17:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845909051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:41,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:41,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:17:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481830544] [2023-08-29 20:17:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:41,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:17:41,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:17:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:17:41,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-29 20:17:41,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 57 transitions, 358 flow. Second operand has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:41,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:41,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-29 20:17:41,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:41,996 INFO L130 PetriNetUnfolder]: 3390/5761 cut-off events. [2023-08-29 20:17:41,996 INFO L131 PetriNetUnfolder]: For 13640/14117 co-relation queries the response was YES. [2023-08-29 20:17:42,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22263 conditions, 5761 events. 3390/5761 cut-off events. For 13640/14117 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 37900 event pairs, 651 based on Foata normal form. 111/5732 useless extension candidates. Maximal degree in co-relation 22237. Up to 3668 conditions per place. [2023-08-29 20:17:42,034 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 80 selfloop transitions, 9 changer transitions 43/145 dead transitions. [2023-08-29 20:17:42,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 145 transitions, 1126 flow [2023-08-29 20:17:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:17:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:17:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1073 transitions. [2023-08-29 20:17:42,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739399293286219 [2023-08-29 20:17:42,038 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1073 transitions. [2023-08-29 20:17:42,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1073 transitions. [2023-08-29 20:17:42,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:42,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1073 transitions. [2023-08-29 20:17:42,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.125) internal successors, (1073), 8 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:42,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:42,044 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:42,044 INFO L175 Difference]: Start difference. First operand has 86 places, 57 transitions, 358 flow. Second operand 8 states and 1073 transitions. [2023-08-29 20:17:42,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 145 transitions, 1126 flow [2023-08-29 20:17:42,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 145 transitions, 1102 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-29 20:17:42,256 INFO L231 Difference]: Finished difference. Result has 90 places, 63 transitions, 446 flow [2023-08-29 20:17:42,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=446, PETRI_PLACES=90, PETRI_TRANSITIONS=63} [2023-08-29 20:17:42,257 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2023-08-29 20:17:42,257 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 63 transitions, 446 flow [2023-08-29 20:17:42,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:42,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:42,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:17:42,258 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:42,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1256077374, now seen corresponding path program 4 times [2023-08-29 20:17:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519346875] [2023-08-29 20:17:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:43,258 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-29 20:17:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:17:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519346875] [2023-08-29 20:17:43,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519346875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:43,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:43,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:17:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356296205] [2023-08-29 20:17:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:17:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:17:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:17:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:17:43,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 283 [2023-08-29 20:17:43,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 63 transitions, 446 flow. Second operand has 9 states, 9 states have (on average 117.33333333333333) internal successors, (1056), 9 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:43,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:43,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 283 [2023-08-29 20:17:43,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:44,396 INFO L130 PetriNetUnfolder]: 4622/7630 cut-off events. [2023-08-29 20:17:44,396 INFO L131 PetriNetUnfolder]: For 25353/25353 co-relation queries the response was YES. [2023-08-29 20:17:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34010 conditions, 7630 events. 4622/7630 cut-off events. For 25353/25353 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 49703 event pairs, 556 based on Foata normal form. 2/7632 useless extension candidates. Maximal degree in co-relation 33982. Up to 3471 conditions per place. [2023-08-29 20:17:44,452 INFO L137 encePairwiseOnDemand]: 272/283 looper letters, 100 selfloop transitions, 12 changer transitions 58/170 dead transitions. [2023-08-29 20:17:44,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 170 transitions, 1442 flow [2023-08-29 20:17:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:17:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:17:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1242 transitions. [2023-08-29 20:17:44,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43886925795053006 [2023-08-29 20:17:44,455 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1242 transitions. [2023-08-29 20:17:44,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1242 transitions. [2023-08-29 20:17:44,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:44,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1242 transitions. [2023-08-29 20:17:44,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.2) internal successors, (1242), 10 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:44,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:44,460 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 283.0) internal successors, (3113), 11 states have internal predecessors, (3113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:44,460 INFO L175 Difference]: Start difference. First operand has 90 places, 63 transitions, 446 flow. Second operand 10 states and 1242 transitions. [2023-08-29 20:17:44,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 170 transitions, 1442 flow [2023-08-29 20:17:44,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 170 transitions, 1395 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-29 20:17:44,785 INFO L231 Difference]: Finished difference. Result has 96 places, 62 transitions, 445 flow [2023-08-29 20:17:44,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=445, PETRI_PLACES=96, PETRI_TRANSITIONS=62} [2023-08-29 20:17:44,785 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2023-08-29 20:17:44,786 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 62 transitions, 445 flow [2023-08-29 20:17:44,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.33333333333333) internal successors, (1056), 9 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:44,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:44,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:44,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:17:44,786 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:44,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash 158922608, now seen corresponding path program 5 times [2023-08-29 20:17:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:17:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252947059] [2023-08-29 20:17:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:17:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:17:44,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:17:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:17:44,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:17:44,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:17:44,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:17:44,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:17:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:17:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:17:44,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:17:44,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:17:44,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:17:44,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:17:44,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:17:44,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:17:44,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:17:44,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:17:44,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:17:44,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:17:44,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:17:44,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:17:44,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:17:44,902 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:17:44,907 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:17:44,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:17:45,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:17:45 BasicIcfg [2023-08-29 20:17:45,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:17:45,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:17:45,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:17:45,005 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:17:45,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:52" (3/4) ... [2023-08-29 20:17:45,008 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:17:45,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:17:45,009 INFO L158 Benchmark]: Toolchain (without parser) took 54377.09ms. Allocated memory was 60.8MB in the beginning and 5.1GB in the end (delta: 5.1GB). Free memory was 36.8MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2023-08-29 20:17:45,009 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 50.3MB. Free memory was 28.7MB in the beginning and 28.7MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:17:45,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.51ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 28.0MB in the end (delta: 8.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-08-29 20:17:45,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.83ms. Allocated memory is still 60.8MB. Free memory was 27.7MB in the beginning and 25.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:17:45,010 INFO L158 Benchmark]: Boogie Preprocessor took 65.28ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 25.4MB in the beginning and 51.4MB in the end (delta: -26.1MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2023-08-29 20:17:45,010 INFO L158 Benchmark]: RCFGBuilder took 814.41ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 29.9MB in the end (delta: 21.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-08-29 20:17:45,011 INFO L158 Benchmark]: TraceAbstraction took 52803.17ms. Allocated memory was 73.4MB in the beginning and 5.1GB in the end (delta: 5.1GB). Free memory was 49.3MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2023-08-29 20:17:45,011 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 5.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:17:45,013 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.55ms. Allocated memory is still 50.3MB. Free memory was 28.7MB in the beginning and 28.7MB in the end (delta: 50.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.51ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 28.0MB in the end (delta: 8.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.83ms. Allocated memory is still 60.8MB. Free memory was 27.7MB in the beginning and 25.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.28ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 25.4MB in the beginning and 51.4MB in the end (delta: -26.1MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * RCFGBuilder took 814.41ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 29.9MB in the end (delta: 21.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52803.17ms. Allocated memory was 73.4MB in the beginning and 5.1GB in the end (delta: 5.1GB). Free memory was 49.3MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 5.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 153 PlacesBefore, 55 PlacesAfterwards, 142 TransitionsBefore, 43 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 6 FixpointIterations, 56 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 10751 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3924, independent: 3689, independent conditional: 0, independent unconditional: 3689, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1863, independent: 1817, independent conditional: 0, independent unconditional: 1817, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3924, independent: 1872, independent conditional: 0, independent unconditional: 1872, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1863, unknown conditional: 0, unknown unconditional: 1863] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t321, ((void *)0), P0, ((void *)0))=-3, t321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t322, ((void *)0), P1, ((void *)0))=-2, t321={5:0}, t322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t323, ((void *)0), P2, ((void *)0))=-1, t321={5:0}, t322={6:0}, t323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t324; [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t324, ((void *)0), P3, ((void *)0))=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={5:0}, t322={6:0}, t323={7:0}, t324={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 52.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1671 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1421 mSDsluCounter, 1215 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1113 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4813 IncrementalHoareTripleChecker+Invalid, 4974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 102 mSDtfsCounter, 4813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 4425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:17:45,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:17:47,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:17:47,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:17:47,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:17:47,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:17:47,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:17:47,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:17:47,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:17:47,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:17:47,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:17:47,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:17:47,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:17:47,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:17:47,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:17:47,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:17:47,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:17:47,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:17:47,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:17:47,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:17:47,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:17:47,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:17:47,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:17:47,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:17:47,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:17:47,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:17:47,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:17:47,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:17:47,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:17:47,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:17:47,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:17:47,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:17:47,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:17:47,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:17:47,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:17:47,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:17:47,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:17:47,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:17:47,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:17:47,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:17:47,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:17:47,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:17:47,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:17:47,353 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:17:47,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:17:47,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:17:47,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:17:47,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:17:47,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:17:47,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:17:47,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:17:47,356 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:17:47,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:17:47,357 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:17:47,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:17:47,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:17:47,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:17:47,358 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:17:47,359 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:17:47,359 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:17:47,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:17:47,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:17:47,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:17:47,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:17:47,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:17:47,360 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:17:47,361 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:17:47,361 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 -> 39bd8ca48891731a487992488872bfabe93c299f5e64a0d2d763ed7464a4fc31 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 -> AFTER [2023-08-29 20:17:47,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:17:47,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:17:47,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:17:47,701 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:17:47,701 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:17:47,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-08-29 20:17:48,894 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:17:49,196 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:17:49,200 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2023-08-29 20:17:49,225 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06223d935/3b5c991e688d4f77b825dae1aeafa616/FLAG89d82e233 [2023-08-29 20:17:49,241 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06223d935/3b5c991e688d4f77b825dae1aeafa616 [2023-08-29 20:17:49,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:17:49,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:17:49,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:17:49,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:17:49,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:17:49,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7418eed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49, skipping insertion in model container [2023-08-29 20:17:49,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:17:49,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:17:49,473 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/mix013.oepc.i[945,958] [2023-08-29 20:17:49,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:17:49,676 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:17:49,686 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/mix013.oepc.i[945,958] [2023-08-29 20:17:49,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:17:49,780 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:17:49,780 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:17:49,786 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:17:49,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49 WrapperNode [2023-08-29 20:17:49,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:17:49,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:17:49,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:17:49,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:17:49,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,829 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2023-08-29 20:17:49,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:17:49,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:17:49,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:17:49,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:17:49,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:17:49,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:17:49,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:17:49,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:17:49,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (1/1) ... [2023-08-29 20:17:49,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:17:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:17:49,904 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-29 20:17:49,912 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-29 20:17:49,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:17:49,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:17:49,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:17:49,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:17:49,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:17:49,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:17:49,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:17:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:17:49,933 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:17:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:17:49,933 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:17:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:17:49,933 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:17:49,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:17:49,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:17:49,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:17:49,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:17:49,935 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:17:50,132 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:17:50,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:17:50,503 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:17:50,609 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:17:50,609 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:17:50,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:17:50 BoogieIcfgContainer [2023-08-29 20:17:50,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:17:50,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:17:50,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:17:50,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:17:50,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:17:49" (1/3) ... [2023-08-29 20:17:50,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3838bf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:17:50, skipping insertion in model container [2023-08-29 20:17:50,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:17:49" (2/3) ... [2023-08-29 20:17:50,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3838bf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:17:50, skipping insertion in model container [2023-08-29 20:17:50,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:17:50" (3/3) ... [2023-08-29 20:17:50,617 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2023-08-29 20:17:50,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:17:50,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:17:50,632 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:17:50,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:17:50,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2023-08-29 20:17:50,771 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2023-08-29 20:17:50,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:17:50,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:17:50,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 314 flow [2023-08-29 20:17:50,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 143 transitions, 298 flow [2023-08-29 20:17:50,789 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:17:50,796 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 143 transitions, 298 flow [2023-08-29 20:17:50,800 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 143 transitions, 298 flow [2023-08-29 20:17:50,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 298 flow [2023-08-29 20:17:50,838 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2023-08-29 20:17:50,839 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:17:50,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:17:50,842 INFO L119 LiptonReduction]: Number of co-enabled transitions 3674 [2023-08-29 20:17:57,992 INFO L134 LiptonReduction]: Checked pairs total: 11735 [2023-08-29 20:17:57,992 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-29 20:17:58,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:17:58,009 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;@73ef3dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:17:58,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:17:58,011 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:17:58,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:17:58,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:58,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:17:58,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:17:58,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:17:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2023-08-29 20:17:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:17:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011407815] [2023-08-29 20:17:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:17:58,027 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-29 20:17:58,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:17:58,033 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-29 20:17:58,039 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-29 20:17:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:17:58,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:17:58,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:17:58,152 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-29 20:17:58,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:17:58,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:17:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011407815] [2023-08-29 20:17:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011407815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:17:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:17:58,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:17:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958889514] [2023-08-29 20:17:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:17:58,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:17:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:17:58,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:17:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:17:58,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 285 [2023-08-29 20:17:58,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:58,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:17:58,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 285 [2023-08-29 20:17:58,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:17:59,852 INFO L130 PetriNetUnfolder]: 9959/13448 cut-off events. [2023-08-29 20:17:59,852 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-29 20:17:59,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27036 conditions, 13448 events. 9959/13448 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 72727 event pairs, 9959 based on Foata normal form. 400/11815 useless extension candidates. Maximal degree in co-relation 27024. Up to 13371 conditions per place. [2023-08-29 20:17:59,944 INFO L137 encePairwiseOnDemand]: 276/285 looper letters, 29 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2023-08-29 20:17:59,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 138 flow [2023-08-29 20:17:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:17:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:17:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 302 transitions. [2023-08-29 20:17:59,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5298245614035088 [2023-08-29 20:17:59,961 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 302 transitions. [2023-08-29 20:17:59,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 302 transitions. [2023-08-29 20:17:59,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:17:59,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 302 transitions. [2023-08-29 20:17:59,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:59,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:59,978 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:59,979 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 302 transitions. [2023-08-29 20:17:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 138 flow [2023-08-29 20:17:59,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:17:59,990 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-29 20:17:59,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-29 20:17:59,994 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-29 20:17:59,995 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-29 20:17:59,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:17:59,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:17:59,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:18:00,014 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-29 20:18:00,214 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-29 20:18:00,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:00,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 609273, now seen corresponding path program 1 times [2023-08-29 20:18:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811322602] [2023-08-29 20:18:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:00,217 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-29 20:18:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:00,218 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-29 20:18:00,248 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-29 20:18:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:00,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:18:00,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:00,333 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-29 20:18:00,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:00,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:00,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811322602] [2023-08-29 20:18:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811322602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:00,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:18:00,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944047237] [2023-08-29 20:18:00,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:00,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:18:00,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:00,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:18:00,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:18:00,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 285 [2023-08-29 20:18:00,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:00,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:00,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 285 [2023-08-29 20:18:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:01,472 INFO L130 PetriNetUnfolder]: 7831/10654 cut-off events. [2023-08-29 20:18:01,472 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:18:01,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21387 conditions, 10654 events. 7831/10654 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 55536 event pairs, 4023 based on Foata normal form. 0/9663 useless extension candidates. Maximal degree in co-relation 21384. Up to 8431 conditions per place. [2023-08-29 20:18:01,521 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 45 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2023-08-29 20:18:01,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 228 flow [2023-08-29 20:18:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:18:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:18:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-29 20:18:01,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52046783625731 [2023-08-29 20:18:01,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-29 20:18:01,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-29 20:18:01,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:01,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-29 20:18:01,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:01,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:01,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:01,529 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 445 transitions. [2023-08-29 20:18:01,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 228 flow [2023-08-29 20:18:01,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:18:01,530 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 74 flow [2023-08-29 20:18:01,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-29 20:18:01,531 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-29 20:18:01,531 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 74 flow [2023-08-29 20:18:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:01,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:01,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:01,547 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-29 20:18:01,741 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-29 20:18:01,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:01,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1443272277, now seen corresponding path program 1 times [2023-08-29 20:18:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949086770] [2023-08-29 20:18:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:01,743 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-29 20:18:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:01,745 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-29 20:18:01,747 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-29 20:18:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:01,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:18:01,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:01,869 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-29 20:18:01,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:01,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949086770] [2023-08-29 20:18:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949086770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:01,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:01,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:18:01,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056606200] [2023-08-29 20:18:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:01,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:18:01,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:18:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:18:01,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 285 [2023-08-29 20:18:01,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 74 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-29 20:18:01,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:01,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 285 [2023-08-29 20:18:01,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:02,599 INFO L130 PetriNetUnfolder]: 4483/6402 cut-off events. [2023-08-29 20:18:02,599 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-29 20:18:02,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13351 conditions, 6402 events. 4483/6402 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 35254 event pairs, 818 based on Foata normal form. 320/6482 useless extension candidates. Maximal degree in co-relation 13347. Up to 4756 conditions per place. [2023-08-29 20:18:02,626 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 40 selfloop transitions, 5 changer transitions 27/77 dead transitions. [2023-08-29 20:18:02,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 322 flow [2023-08-29 20:18:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2023-08-29 20:18:02,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49403508771929827 [2023-08-29 20:18:02,629 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2023-08-29 20:18:02,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2023-08-29 20:18:02,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:02,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2023-08-29 20:18:02,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:02,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:02,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:02,634 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 74 flow. Second operand 5 states and 704 transitions. [2023-08-29 20:18:02,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 322 flow [2023-08-29 20:18:02,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:02,636 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 115 flow [2023-08-29 20:18:02,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-29 20:18:02,637 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-08-29 20:18:02,638 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 115 flow [2023-08-29 20:18:02,638 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-29 20:18:02,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:02,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:02,650 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-29 20:18:02,847 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-29 20:18:02,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:02,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1905569820, now seen corresponding path program 1 times [2023-08-29 20:18:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984398257] [2023-08-29 20:18:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:02,849 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-29 20:18:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:02,850 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-29 20:18:02,854 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-29 20:18:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:02,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:18:02,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:02,995 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-29 20:18:02,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:02,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984398257] [2023-08-29 20:18:02,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984398257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:02,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568195379] [2023-08-29 20:18:02,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:02,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:03,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 285 [2023-08-29 20:18:03,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:03,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:03,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 285 [2023-08-29 20:18:03,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:03,492 INFO L130 PetriNetUnfolder]: 2161/3297 cut-off events. [2023-08-29 20:18:03,493 INFO L131 PetriNetUnfolder]: For 1178/1178 co-relation queries the response was YES. [2023-08-29 20:18:03,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 3297 events. 2161/3297 cut-off events. For 1178/1178 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17607 event pairs, 403 based on Foata normal form. 212/3404 useless extension candidates. Maximal degree in co-relation 8685. Up to 1426 conditions per place. [2023-08-29 20:18:03,512 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 53 selfloop transitions, 9 changer transitions 27/94 dead transitions. [2023-08-29 20:18:03,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 471 flow [2023-08-29 20:18:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:18:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:18:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2023-08-29 20:18:03,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953216374269006 [2023-08-29 20:18:03,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 847 transitions. [2023-08-29 20:18:03,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions. [2023-08-29 20:18:03,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:03,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions. [2023-08-29 20:18:03,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:03,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:03,521 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:03,521 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 115 flow. Second operand 6 states and 847 transitions. [2023-08-29 20:18:03,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 471 flow [2023-08-29 20:18:03,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 464 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:18:03,533 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 180 flow [2023-08-29 20:18:03,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-29 20:18:03,534 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-29 20:18:03,534 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 180 flow [2023-08-29 20:18:03,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:03,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:03,535 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-29 20:18:03,547 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-29 20:18:03,744 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-29 20:18:03,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:03,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1010739471, now seen corresponding path program 1 times [2023-08-29 20:18:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:03,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864444762] [2023-08-29 20:18:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:03,745 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-29 20:18:03,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:03,746 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-29 20:18:03,747 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-29 20:18:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:03,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:18:03,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:03,925 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-29 20:18:03,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:03,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864444762] [2023-08-29 20:18:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864444762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:18:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131984111] [2023-08-29 20:18:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:03,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:18:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:18:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:18:03,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 285 [2023-08-29 20:18:03,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:03,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:03,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 285 [2023-08-29 20:18:03,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:04,355 INFO L130 PetriNetUnfolder]: 1189/1875 cut-off events. [2023-08-29 20:18:04,355 INFO L131 PetriNetUnfolder]: For 1801/1801 co-relation queries the response was YES. [2023-08-29 20:18:04,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 1875 events. 1189/1875 cut-off events. For 1801/1801 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9410 event pairs, 331 based on Foata normal form. 77/1910 useless extension candidates. Maximal degree in co-relation 5586. Up to 630 conditions per place. [2023-08-29 20:18:04,365 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 64 selfloop transitions, 13 changer transitions 27/109 dead transitions. [2023-08-29 20:18:04,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 109 transitions, 640 flow [2023-08-29 20:18:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:18:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:18:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 988 transitions. [2023-08-29 20:18:04,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-29 20:18:04,369 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 988 transitions. [2023-08-29 20:18:04,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 988 transitions. [2023-08-29 20:18:04,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:04,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 988 transitions. [2023-08-29 20:18:04,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:04,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:04,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:04,377 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 180 flow. Second operand 7 states and 988 transitions. [2023-08-29 20:18:04,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 109 transitions, 640 flow [2023-08-29 20:18:04,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 578 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:18:04,391 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 230 flow [2023-08-29 20:18:04,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-29 20:18:04,392 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2023-08-29 20:18:04,392 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 230 flow [2023-08-29 20:18:04,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:04,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:04,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:04,405 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-29 20:18:04,602 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-29 20:18:04,603 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:04,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash -65762821, now seen corresponding path program 1 times [2023-08-29 20:18:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182073599] [2023-08-29 20:18:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:04,604 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-29 20:18:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:04,605 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-29 20:18:04,607 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-29 20:18:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:04,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:18:04,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:04,770 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-29 20:18:04,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:04,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:04,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182073599] [2023-08-29 20:18:04,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182073599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:04,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:04,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:18:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040625217] [2023-08-29 20:18:04,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:04,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:18:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:18:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:18:04,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 285 [2023-08-29 20:18:04,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:04,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:04,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 285 [2023-08-29 20:18:04,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:05,175 INFO L130 PetriNetUnfolder]: 1011/1569 cut-off events. [2023-08-29 20:18:05,175 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-29 20:18:05,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 1569 events. 1011/1569 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7703 event pairs, 326 based on Foata normal form. 14/1554 useless extension candidates. Maximal degree in co-relation 4511. Up to 630 conditions per place. [2023-08-29 20:18:05,184 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 60 selfloop transitions, 17 changer transitions 14/96 dead transitions. [2023-08-29 20:18:05,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 576 flow [2023-08-29 20:18:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:18:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:18:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1101 transitions. [2023-08-29 20:18:05,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48289473684210527 [2023-08-29 20:18:05,187 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1101 transitions. [2023-08-29 20:18:05,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1101 transitions. [2023-08-29 20:18:05,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:05,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1101 transitions. [2023-08-29 20:18:05,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.625) internal successors, (1101), 8 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:05,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:05,194 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:05,194 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 230 flow. Second operand 8 states and 1101 transitions. [2023-08-29 20:18:05,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 576 flow [2023-08-29 20:18:05,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 514 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:18:05,209 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 224 flow [2023-08-29 20:18:05,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-29 20:18:05,209 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-29 20:18:05,210 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 224 flow [2023-08-29 20:18:05,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:05,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:05,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:05,221 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-29 20:18:05,420 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-29 20:18:05,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:05,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash -406525639, now seen corresponding path program 1 times [2023-08-29 20:18:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:05,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332521049] [2023-08-29 20:18:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:05,422 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-29 20:18:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:05,423 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-29 20:18:05,426 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-29 20:18:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:05,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:18:05,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:18:06,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:06,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:06,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332521049] [2023-08-29 20:18:06,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332521049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:06,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:06,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:06,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506935381] [2023-08-29 20:18:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:06,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:18:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:06,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:18:06,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:18:06,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 285 [2023-08-29 20:18:06,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:06,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:06,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 285 [2023-08-29 20:18:06,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:07,218 INFO L130 PetriNetUnfolder]: 999/1577 cut-off events. [2023-08-29 20:18:07,218 INFO L131 PetriNetUnfolder]: For 1953/1953 co-relation queries the response was YES. [2023-08-29 20:18:07,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4480 conditions, 1577 events. 999/1577 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8066 event pairs, 28 based on Foata normal form. 0/1573 useless extension candidates. Maximal degree in co-relation 4469. Up to 1252 conditions per place. [2023-08-29 20:18:07,228 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 59 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-08-29 20:18:07,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 481 flow [2023-08-29 20:18:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:18:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:18:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2023-08-29 20:18:07,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41871345029239765 [2023-08-29 20:18:07,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2023-08-29 20:18:07,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2023-08-29 20:18:07,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:07,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2023-08-29 20:18:07,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:07,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:07,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:07,237 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 224 flow. Second operand 6 states and 716 transitions. [2023-08-29 20:18:07,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 481 flow [2023-08-29 20:18:07,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 392 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-29 20:18:07,242 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 166 flow [2023-08-29 20:18:07,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-29 20:18:07,243 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2023-08-29 20:18:07,243 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 166 flow [2023-08-29 20:18:07,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:07,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:07,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:07,260 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-29 20:18:07,460 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-29 20:18:07,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:07,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash -633616101, now seen corresponding path program 1 times [2023-08-29 20:18:07,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:07,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489454360] [2023-08-29 20:18:07,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:18:07,462 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-29 20:18:07,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:07,463 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-29 20:18:07,466 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-29 20:18:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:18:07,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:18:07,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:08,055 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-29 20:18:08,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:08,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:08,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489454360] [2023-08-29 20:18:08,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489454360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:08,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:08,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:18:08,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469990407] [2023-08-29 20:18:08,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:08,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:18:08,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:08,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:18:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:18:08,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 285 [2023-08-29 20:18:08,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:08,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:08,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 285 [2023-08-29 20:18:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:08,574 INFO L130 PetriNetUnfolder]: 1159/1890 cut-off events. [2023-08-29 20:18:08,574 INFO L131 PetriNetUnfolder]: For 1123/1123 co-relation queries the response was YES. [2023-08-29 20:18:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 1890 events. 1159/1890 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10553 event pairs, 145 based on Foata normal form. 1/1882 useless extension candidates. Maximal degree in co-relation 4989. Up to 773 conditions per place. [2023-08-29 20:18:08,582 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 69 selfloop transitions, 4 changer transitions 32/110 dead transitions. [2023-08-29 20:18:08,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 672 flow [2023-08-29 20:18:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:18:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:18:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1070 transitions. [2023-08-29 20:18:08,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692982456140351 [2023-08-29 20:18:08,586 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1070 transitions. [2023-08-29 20:18:08,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1070 transitions. [2023-08-29 20:18:08,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:08,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1070 transitions. [2023-08-29 20:18:08,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.75) internal successors, (1070), 8 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:08,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:08,592 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:08,592 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 166 flow. Second operand 8 states and 1070 transitions. [2023-08-29 20:18:08,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 672 flow [2023-08-29 20:18:08,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 110 transitions, 655 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:18:08,602 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 175 flow [2023-08-29 20:18:08,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-29 20:18:08,603 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-29 20:18:08,603 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 175 flow [2023-08-29 20:18:08,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:08,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:08,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:08,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:18:08,813 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-29 20:18:08,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:08,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1855633769, now seen corresponding path program 2 times [2023-08-29 20:18:08,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429322651] [2023-08-29 20:18:08,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:18:08,815 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-29 20:18:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:08,816 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-29 20:18:08,819 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-29 20:18:08,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:18:08,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:18:08,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:18:08,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:08,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-29 20:18:08,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:08,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429322651] [2023-08-29 20:18:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429322651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732627705] [2023-08-29 20:18:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:08,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:08,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:09,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 285 [2023-08-29 20:18:09,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:09,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:09,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 285 [2023-08-29 20:18:09,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:09,363 INFO L130 PetriNetUnfolder]: 1736/2944 cut-off events. [2023-08-29 20:18:09,363 INFO L131 PetriNetUnfolder]: For 2072/2072 co-relation queries the response was YES. [2023-08-29 20:18:09,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7942 conditions, 2944 events. 1736/2944 cut-off events. For 2072/2072 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17881 event pairs, 191 based on Foata normal form. 1/2937 useless extension candidates. Maximal degree in co-relation 7931. Up to 1405 conditions per place. [2023-08-29 20:18:09,376 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 56 selfloop transitions, 1 changer transitions 32/93 dead transitions. [2023-08-29 20:18:09,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 582 flow [2023-08-29 20:18:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2023-08-29 20:18:09,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48771929824561405 [2023-08-29 20:18:09,379 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2023-08-29 20:18:09,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2023-08-29 20:18:09,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:09,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2023-08-29 20:18:09,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:09,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:09,383 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:09,384 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 175 flow. Second operand 5 states and 695 transitions. [2023-08-29 20:18:09,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 582 flow [2023-08-29 20:18:09,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 93 transitions, 560 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:18:09,405 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 172 flow [2023-08-29 20:18:09,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-29 20:18:09,406 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-29 20:18:09,406 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 172 flow [2023-08-29 20:18:09,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:09,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:09,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:09,420 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-29 20:18:09,617 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-29 20:18:09,617 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:09,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash -519703929, now seen corresponding path program 3 times [2023-08-29 20:18:09,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:09,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493923416] [2023-08-29 20:18:09,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:18:09,619 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-29 20:18:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:09,620 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-29 20:18:09,660 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-29 20:18:09,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:18:09,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:18:09,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:18:09,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:09,780 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-29 20:18:09,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:09,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:09,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493923416] [2023-08-29 20:18:09,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493923416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:09,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935056441] [2023-08-29 20:18:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:09,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 285 [2023-08-29 20:18:09,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:09,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:09,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 285 [2023-08-29 20:18:09,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:10,126 INFO L130 PetriNetUnfolder]: 1971/3176 cut-off events. [2023-08-29 20:18:10,126 INFO L131 PetriNetUnfolder]: For 2369/2370 co-relation queries the response was YES. [2023-08-29 20:18:10,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 3176 events. 1971/3176 cut-off events. For 2369/2370 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17615 event pairs, 341 based on Foata normal form. 1/3143 useless extension candidates. Maximal degree in co-relation 8688. Up to 1540 conditions per place. [2023-08-29 20:18:10,137 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 53 selfloop transitions, 1 changer transitions 31/89 dead transitions. [2023-08-29 20:18:10,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 554 flow [2023-08-29 20:18:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-29 20:18:10,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849122807017544 [2023-08-29 20:18:10,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-29 20:18:10,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-29 20:18:10,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:10,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-29 20:18:10,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,145 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,145 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 172 flow. Second operand 5 states and 691 transitions. [2023-08-29 20:18:10,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 554 flow [2023-08-29 20:18:10,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 546 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:18:10,168 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 176 flow [2023-08-29 20:18:10,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-29 20:18:10,169 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-29 20:18:10,169 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 176 flow [2023-08-29 20:18:10,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:10,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:10,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-08-29 20:18:10,379 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-29 20:18:10,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:10,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1473209677, now seen corresponding path program 4 times [2023-08-29 20:18:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845125782] [2023-08-29 20:18:10,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:18:10,380 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-29 20:18:10,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:10,382 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-29 20:18:10,382 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-29 20:18:10,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:18:10,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:18:10,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:18:10,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:18:10,528 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-29 20:18:10,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:18:10,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:18:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845125782] [2023-08-29 20:18:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845125782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:18:10,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:18:10,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:18:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399195853] [2023-08-29 20:18:10,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:18:10,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:18:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:18:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:18:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:18:10,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 285 [2023-08-29 20:18:10,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:18:10,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 285 [2023-08-29 20:18:10,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:18:10,948 INFO L130 PetriNetUnfolder]: 2049/3321 cut-off events. [2023-08-29 20:18:10,948 INFO L131 PetriNetUnfolder]: For 2835/2846 co-relation queries the response was YES. [2023-08-29 20:18:10,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9325 conditions, 3321 events. 2049/3321 cut-off events. For 2835/2846 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18278 event pairs, 703 based on Foata normal form. 1/3232 useless extension candidates. Maximal degree in co-relation 9312. Up to 1292 conditions per place. [2023-08-29 20:18:10,958 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 43 selfloop transitions, 1 changer transitions 36/84 dead transitions. [2023-08-29 20:18:10,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 534 flow [2023-08-29 20:18:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:18:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:18:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-29 20:18:10,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48140350877192983 [2023-08-29 20:18:10,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-29 20:18:10,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-29 20:18:10,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:18:10,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-29 20:18:10,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,965 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 176 flow. Second operand 5 states and 686 transitions. [2023-08-29 20:18:10,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 534 flow [2023-08-29 20:18:10,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 526 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:18:10,991 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 180 flow [2023-08-29 20:18:10,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-08-29 20:18:10,991 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-29 20:18:10,991 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 180 flow [2023-08-29 20:18:10,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:18:10,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:18:10,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:11,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:18:11,197 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-29 20:18:11,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:18:11,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:18:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash -502099313, now seen corresponding path program 5 times [2023-08-29 20:18:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:18:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447976332] [2023-08-29 20:18:11,198 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:18:11,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:18:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:18:11,200 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-29 20:18:11,200 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-29 20:18:11,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:18:11,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:18:11,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:18:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:18:11,474 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:18:11,474 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:18:11,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:18:11,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:18:11,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:18:11,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:18:11,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:18:11,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:18:11,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:18:11,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:18:11,492 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-29 20:18:11,689 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-29 20:18:11,690 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:18:11,695 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:18:11,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:18:11,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:18:11 BasicIcfg [2023-08-29 20:18:11,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:18:11,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:18:11,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:18:11,781 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:18:11,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:17:50" (3/4) ... [2023-08-29 20:18:11,784 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:18:11,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:18:11,788 INFO L158 Benchmark]: Toolchain (without parser) took 22543.12ms. Allocated memory was 77.6MB in the beginning and 801.1MB in the end (delta: 723.5MB). Free memory was 54.0MB in the beginning and 460.0MB in the end (delta: -406.0MB). Peak memory consumption was 317.6MB. Max. memory is 16.1GB. [2023-08-29 20:18:11,789 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 77.6MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:18:11,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.35ms. Allocated memory is still 77.6MB. Free memory was 53.8MB in the beginning and 50.6MB in the end (delta: 3.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-29 20:18:11,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.22ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 48.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:18:11,789 INFO L158 Benchmark]: Boogie Preprocessor took 35.79ms. Allocated memory is still 77.6MB. Free memory was 48.1MB in the beginning and 45.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:18:11,790 INFO L158 Benchmark]: RCFGBuilder took 744.19ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 65.6MB in the end (delta: -19.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2023-08-29 20:18:11,790 INFO L158 Benchmark]: TraceAbstraction took 21167.89ms. Allocated memory was 94.4MB in the beginning and 801.1MB in the end (delta: 706.7MB). Free memory was 64.9MB in the beginning and 460.0MB in the end (delta: -395.0MB). Peak memory consumption was 310.2MB. Max. memory is 16.1GB. [2023-08-29 20:18:11,790 INFO L158 Benchmark]: Witness Printer took 6.92ms. Allocated memory is still 801.1MB. Free memory is still 460.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:18:11,791 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.09ms. Allocated memory is still 77.6MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.35ms. Allocated memory is still 77.6MB. Free memory was 53.8MB in the beginning and 50.6MB in the end (delta: 3.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.22ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 48.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.79ms. Allocated memory is still 77.6MB. Free memory was 48.1MB in the beginning and 45.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 744.19ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 65.6MB in the end (delta: -19.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21167.89ms. Allocated memory was 94.4MB in the beginning and 801.1MB in the end (delta: 706.7MB). Free memory was 64.9MB in the beginning and 460.0MB in the end (delta: -395.0MB). Peak memory consumption was 310.2MB. Max. memory is 16.1GB. * Witness Printer took 6.92ms. Allocated memory is still 801.1MB. Free memory is still 460.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 154 PlacesBefore, 55 PlacesAfterwards, 143 TransitionsBefore, 43 TransitionsAfterwards, 3674 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 138 TotalNumberOfCompositions, 11735 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4095, independent: 3824, independent conditional: 0, independent unconditional: 3824, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1869, independent: 1817, independent conditional: 0, independent unconditional: 1817, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4095, independent: 2007, independent conditional: 0, independent unconditional: 2007, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 1869, unknown conditional: 0, unknown unconditional: 1869] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t321, ((void *)0), P0, ((void *)0))=0, t321={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t322, ((void *)0), P1, ((void *)0))=1, t321={3:0}, t322={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t323, ((void *)0), P2, ((void *)0))=2, t321={3:0}, t322={7:0}, t323={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L879] 0 pthread_t t324; [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t324, ((void *)0), P3, ((void *)0))=3, t321={3:0}, t322={7:0}, t323={11:0}, t324={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L829] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t321={3:0}, t322={7:0}, t323={11:0}, t324={15:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 617 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2589 IncrementalHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 18 mSDtfsCounter, 2589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 22 QuantifiedInterpolants, 2076 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1764 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:18:11,807 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample