./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.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/mix009.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 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 --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:15:39,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:15:39,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:15:39,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:15:39,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:15:39,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:15:39,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:15:39,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:15:39,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:15:39,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:15:39,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:15:39,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:15:39,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:15:39,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:15:39,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:15:39,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:15:39,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:15:39,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:15:39,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:15:39,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:15:39,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:15:39,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:15:39,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:15:39,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:15:39,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:15:39,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:15:39,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:15:39,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:15:39,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:15:39,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:15:39,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:15:39,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:15:39,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:15:39,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:15:39,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:15:39,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:15:39,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:15:39,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:15:39,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:15:39,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:15:39,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:15:39,867 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:15:39,897 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:15:39,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:15:39,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:15:39,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:15:39,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:15:39,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:15:39,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:15:39,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:15:39,901 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:15:39,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:15:39,902 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:15:39,902 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:15:39,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:15:39,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:15:39,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:15:39,903 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:15:39,903 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:15:39,903 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:15:39,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:15:39,904 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:15:39,904 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:15:39,904 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:15:39,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:15:39,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:15:39,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:15:39,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:15:39,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:15:39,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:15:39,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:15:39,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:15:39,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:15:39,906 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:15:39,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:15:39,906 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:15:39,906 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 -> 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 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:15:40,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:15:40,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:15:40,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:15:40,264 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:15:40,264 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:15:40,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2023-08-29 20:15:41,420 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:15:41,647 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:15:41,647 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2023-08-29 20:15:41,662 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d85fc2b/04225c8736f240b0bac08458d5ca81f3/FLAG01dfc67f9 [2023-08-29 20:15:41,677 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d85fc2b/04225c8736f240b0bac08458d5ca81f3 [2023-08-29 20:15:41,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:15:41,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:15:41,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:15:41,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:15:41,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:15:41,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:15:41" (1/1) ... [2023-08-29 20:15:41,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cafc23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:41, skipping insertion in model container [2023-08-29 20:15:41,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:15:41" (1/1) ... [2023-08-29 20:15:41,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:15:41,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:15:41,866 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/mix009.oepc.i[945,958] [2023-08-29 20:15:42,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:15:42,051 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:15:42,062 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/mix009.oepc.i[945,958] [2023-08-29 20:15:42,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:15:42,166 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:15:42,166 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:15:42,172 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:15:42,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42 WrapperNode [2023-08-29 20:15:42,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:15:42,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:15:42,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:15:42,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:15:42,180 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:15:42" (1/1) ... [2023-08-29 20:15:42,194 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:15:42" (1/1) ... [2023-08-29 20:15:42,216 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2023-08-29 20:15:42,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:15:42,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:15:42,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:15:42,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:15:42,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,241 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:15:42,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:15:42,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:15:42,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:15:42,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (1/1) ... [2023-08-29 20:15:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:15:42,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:15:42,277 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:15:42,289 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:15:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:15:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:15:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:15:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:15:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:15:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:15:42,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:15:42,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:15:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:15:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:15:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:15:42,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:15:42,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:15:42,324 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:15:42,463 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:15:42,465 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:15:42,812 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:15:42,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:15:42,914 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:15:42,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:15:42 BoogieIcfgContainer [2023-08-29 20:15:42,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:15:42,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:15:42,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:15:42,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:15:42,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:15:41" (1/3) ... [2023-08-29 20:15:42,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6384ee2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:15:42, skipping insertion in model container [2023-08-29 20:15:42,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:42" (2/3) ... [2023-08-29 20:15:42,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6384ee2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:15:42, skipping insertion in model container [2023-08-29 20:15:42,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:15:42" (3/3) ... [2023-08-29 20:15:42,925 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2023-08-29 20:15:42,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:15:42,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:15:42,941 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:15:42,984 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:15:43,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 102 transitions, 214 flow [2023-08-29 20:15:43,089 INFO L130 PetriNetUnfolder]: 2/100 cut-off events. [2023-08-29 20:15:43,089 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:15:43,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-29 20:15:43,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 102 transitions, 214 flow [2023-08-29 20:15:43,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 100 transitions, 206 flow [2023-08-29 20:15:43,105 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:15:43,115 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 100 transitions, 206 flow [2023-08-29 20:15:43,117 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 100 transitions, 206 flow [2023-08-29 20:15:43,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 206 flow [2023-08-29 20:15:43,143 INFO L130 PetriNetUnfolder]: 2/100 cut-off events. [2023-08-29 20:15:43,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:15:43,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-29 20:15:43,145 INFO L119 LiptonReduction]: Number of co-enabled transitions 1420 [2023-08-29 20:15:46,405 INFO L134 LiptonReduction]: Checked pairs total: 3655 [2023-08-29 20:15:46,406 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-29 20:15:46,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:15:46,423 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;@389d769a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:15:46,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:15:46,424 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:15:46,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:15:46,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:46,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:15:46,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:46,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 459, now seen corresponding path program 1 times [2023-08-29 20:15:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082612054] [2023-08-29 20:15:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:46,521 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:15:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082612054] [2023-08-29 20:15:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082612054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:15:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392402634] [2023-08-29 20:15:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:46,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:15:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:15:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:15:46,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 205 [2023-08-29 20:15:46,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:15:46,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:46,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 205 [2023-08-29 20:15:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:46,685 INFO L130 PetriNetUnfolder]: 324/560 cut-off events. [2023-08-29 20:15:46,685 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:15:46,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 560 events. 324/560 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2372 event pairs, 324 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 1115. Up to 548 conditions per place. [2023-08-29 20:15:46,690 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-29 20:15:46,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-08-29 20:15:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:15:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:15:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 206 transitions. [2023-08-29 20:15:46,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024390243902439 [2023-08-29 20:15:46,703 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 206 transitions. [2023-08-29 20:15:46,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 206 transitions. [2023-08-29 20:15:46,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:46,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 206 transitions. [2023-08-29 20:15:46,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:15:46,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 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:15:46,712 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 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:15:46,714 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 206 transitions. [2023-08-29 20:15:46,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-08-29 20:15:46,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:46,717 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-08-29 20:15:46,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-29 20:15:46,722 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-29 20:15:46,722 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-08-29 20:15:46,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.5) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:15:46,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:46,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:15:46,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:15:46,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:46,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash 452584, now seen corresponding path program 1 times [2023-08-29 20:15:46,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:46,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664737760] [2023-08-29 20:15:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:47,000 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:15:47,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664737760] [2023-08-29 20:15:47,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664737760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:47,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:15:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385594335] [2023-08-29 20:15:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:47,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:15:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:47,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:15:47,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:15:47,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 205 [2023-08-29 20:15:47,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:15:47,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:47,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 205 [2023-08-29 20:15:47,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:47,114 INFO L130 PetriNetUnfolder]: 264/489 cut-off events. [2023-08-29 20:15:47,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:15:47,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 489 events. 264/489 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2342 event pairs, 24 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 951. Up to 389 conditions per place. [2023-08-29 20:15:47,120 INFO L137 encePairwiseOnDemand]: 202/205 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-29 20:15:47,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 130 flow [2023-08-29 20:15:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:15:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:15:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-29 20:15:47,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894308943089431 [2023-08-29 20:15:47,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-29 20:15:47,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-29 20:15:47,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:47,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-29 20:15:47,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:15:47,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:15:47,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:15:47,140 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 301 transitions. [2023-08-29 20:15:47,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 130 flow [2023-08-29 20:15:47,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:15:47,142 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 46 flow [2023-08-29 20:15:47,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-08-29 20:15:47,143 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-08-29 20:15:47,143 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 46 flow [2023-08-29 20:15:47,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:15:47,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:47,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:47,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:15:47,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:47,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1416214379, now seen corresponding path program 1 times [2023-08-29 20:15:47,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051085244] [2023-08-29 20:15:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:47,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:47,439 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:15:47,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:47,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051085244] [2023-08-29 20:15:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051085244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:15:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009220705] [2023-08-29 20:15:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:47,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:15:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:15:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:15:47,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 205 [2023-08-29 20:15:47,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:47,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:47,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 205 [2023-08-29 20:15:47,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:47,591 INFO L130 PetriNetUnfolder]: 399/688 cut-off events. [2023-08-29 20:15:47,591 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 20:15:47,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 688 events. 399/688 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2962 event pairs, 143 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 1435. Up to 517 conditions per place. [2023-08-29 20:15:47,595 INFO L137 encePairwiseOnDemand]: 198/205 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2023-08-29 20:15:47,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 152 flow [2023-08-29 20:15:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:15:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:15:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-29 20:15:47,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682926829268293 [2023-08-29 20:15:47,597 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-29 20:15:47,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-29 20:15:47,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:47,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-29 20:15:47,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:47,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:15:47,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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:15:47,601 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 46 flow. Second operand 3 states and 288 transitions. [2023-08-29 20:15:47,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 152 flow [2023-08-29 20:15:47,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:47,602 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 88 flow [2023-08-29 20:15:47,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2023-08-29 20:15:47,603 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-08-29 20:15:47,606 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 88 flow [2023-08-29 20:15:47,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:47,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:47,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:47,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:15:47,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:47,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash 952973245, now seen corresponding path program 1 times [2023-08-29 20:15:47,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:47,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286163978] [2023-08-29 20:15:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:47,809 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:15:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286163978] [2023-08-29 20:15:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286163978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:15:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989813762] [2023-08-29 20:15:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:15:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:15:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:15:47,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 205 [2023-08-29 20:15:47,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:15:47,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:47,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 205 [2023-08-29 20:15:47,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:48,108 INFO L130 PetriNetUnfolder]: 450/843 cut-off events. [2023-08-29 20:15:48,108 INFO L131 PetriNetUnfolder]: For 234/250 co-relation queries the response was YES. [2023-08-29 20:15:48,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 843 events. 450/843 cut-off events. For 234/250 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4337 event pairs, 326 based on Foata normal form. 61/876 useless extension candidates. Maximal degree in co-relation 2044. Up to 359 conditions per place. [2023-08-29 20:15:48,113 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 29 selfloop transitions, 3 changer transitions 12/48 dead transitions. [2023-08-29 20:15:48,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 250 flow [2023-08-29 20:15:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:15:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:15:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2023-08-29 20:15:48,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2023-08-29 20:15:48,116 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2023-08-29 20:15:48,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2023-08-29 20:15:48,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:48,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2023-08-29 20:15:48,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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:15:48,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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:15:48,120 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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:15:48,121 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 88 flow. Second operand 5 states and 440 transitions. [2023-08-29 20:15:48,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 250 flow [2023-08-29 20:15:48,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:48,124 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 96 flow [2023-08-29 20:15:48,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-08-29 20:15:48,125 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-29 20:15:48,126 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 96 flow [2023-08-29 20:15:48,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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:15:48,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:48,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:48,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:15:48,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:48,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 296303943, now seen corresponding path program 1 times [2023-08-29 20:15:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:48,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589038067] [2023-08-29 20:15:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:48,271 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:15:48,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:48,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589038067] [2023-08-29 20:15:48,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589038067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:48,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:15:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525209424] [2023-08-29 20:15:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:48,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:15:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:15:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:15:48,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 205 [2023-08-29 20:15:48,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:15:48,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:48,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 205 [2023-08-29 20:15:48,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:48,421 INFO L130 PetriNetUnfolder]: 432/761 cut-off events. [2023-08-29 20:15:48,421 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-29 20:15:48,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 761 events. 432/761 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3320 event pairs, 130 based on Foata normal form. 16/777 useless extension candidates. Maximal degree in co-relation 1888. Up to 493 conditions per place. [2023-08-29 20:15:48,426 INFO L137 encePairwiseOnDemand]: 199/205 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-08-29 20:15:48,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 214 flow [2023-08-29 20:15:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:15:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:15:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2023-08-29 20:15:48,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2023-08-29 20:15:48,428 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 372 transitions. [2023-08-29 20:15:48,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions. [2023-08-29 20:15:48,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:48,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions. [2023-08-29 20:15:48,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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:15:48,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states 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:15:48,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states 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:15:48,432 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 96 flow. Second operand 4 states and 372 transitions. [2023-08-29 20:15:48,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 214 flow [2023-08-29 20:15:48,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 206 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:15:48,435 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 132 flow [2023-08-29 20:15:48,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-29 20:15:48,435 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-08-29 20:15:48,436 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 132 flow [2023-08-29 20:15:48,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:15:48,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:48,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:48,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:15:48,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:48,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash -524154404, now seen corresponding path program 1 times [2023-08-29 20:15:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722305528] [2023-08-29 20:15:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:48,600 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:15:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722305528] [2023-08-29 20:15:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722305528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:48,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:15:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662103684] [2023-08-29 20:15:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:48,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:15:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:15:48,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:15:48,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 205 [2023-08-29 20:15:48,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:15:48,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:48,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 205 [2023-08-29 20:15:48,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:48,747 INFO L130 PetriNetUnfolder]: 418/739 cut-off events. [2023-08-29 20:15:48,748 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2023-08-29 20:15:48,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 739 events. 418/739 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3175 event pairs, 250 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 1981. Up to 564 conditions per place. [2023-08-29 20:15:48,752 INFO L137 encePairwiseOnDemand]: 198/205 looper letters, 31 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2023-08-29 20:15:48,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 252 flow [2023-08-29 20:15:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:15:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:15:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-08-29 20:15:48,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2023-08-29 20:15:48,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-08-29 20:15:48,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-08-29 20:15:48,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:48,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-08-29 20:15:48,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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:15:48,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states 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:15:48,760 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states 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:15:48,760 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 132 flow. Second operand 4 states and 374 transitions. [2023-08-29 20:15:48,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 252 flow [2023-08-29 20:15:48,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:15:48,764 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 170 flow [2023-08-29 20:15:48,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-29 20:15:48,766 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-29 20:15:48,767 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 170 flow [2023-08-29 20:15:48,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:15:48,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:48,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:48,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:15:48,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:48,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1061497889, now seen corresponding path program 1 times [2023-08-29 20:15:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:48,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568109098] [2023-08-29 20:15:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:49,107 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:15:49,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568109098] [2023-08-29 20:15:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568109098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:49,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:15:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692935366] [2023-08-29 20:15:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:15:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:15:49,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:15:49,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 205 [2023-08-29 20:15:49,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:49,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:49,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 205 [2023-08-29 20:15:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:49,372 INFO L130 PetriNetUnfolder]: 283/541 cut-off events. [2023-08-29 20:15:49,372 INFO L131 PetriNetUnfolder]: For 712/725 co-relation queries the response was YES. [2023-08-29 20:15:49,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 541 events. 283/541 cut-off events. For 712/725 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2446 event pairs, 219 based on Foata normal form. 40/567 useless extension candidates. Maximal degree in co-relation 1533. Up to 410 conditions per place. [2023-08-29 20:15:49,375 INFO L137 encePairwiseOnDemand]: 199/205 looper letters, 16 selfloop transitions, 7 changer transitions 12/38 dead transitions. [2023-08-29 20:15:49,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 262 flow [2023-08-29 20:15:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:15:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:15:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 496 transitions. [2023-08-29 20:15:49,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032520325203252 [2023-08-29 20:15:49,378 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 496 transitions. [2023-08-29 20:15:49,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 496 transitions. [2023-08-29 20:15:49,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:49,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 496 transitions. [2023-08-29 20:15:49,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:15:49,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states 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:15:49,382 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states 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:15:49,382 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 170 flow. Second operand 6 states and 496 transitions. [2023-08-29 20:15:49,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 262 flow [2023-08-29 20:15:49,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:15:49,386 INFO L231 Difference]: Finished difference. Result has 46 places, 25 transitions, 140 flow [2023-08-29 20:15:49,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=25} [2023-08-29 20:15:49,387 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-08-29 20:15:49,387 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 25 transitions, 140 flow [2023-08-29 20:15:49,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:49,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:49,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:49,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:15:49,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:49,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 388586944, now seen corresponding path program 1 times [2023-08-29 20:15:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43099093] [2023-08-29 20:15:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:49,561 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:15:49,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:49,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43099093] [2023-08-29 20:15:49,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43099093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:49,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:15:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232716239] [2023-08-29 20:15:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:49,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:15:49,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:15:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:15:49,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 205 [2023-08-29 20:15:49,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 25 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:15:49,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:49,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 205 [2023-08-29 20:15:49,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:49,677 INFO L130 PetriNetUnfolder]: 135/311 cut-off events. [2023-08-29 20:15:49,677 INFO L131 PetriNetUnfolder]: For 153/161 co-relation queries the response was YES. [2023-08-29 20:15:49,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 311 events. 135/311 cut-off events. For 153/161 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1384 event pairs, 28 based on Foata normal form. 51/360 useless extension candidates. Maximal degree in co-relation 849. Up to 128 conditions per place. [2023-08-29 20:15:49,679 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 34 selfloop transitions, 5 changer transitions 11/53 dead transitions. [2023-08-29 20:15:49,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 339 flow [2023-08-29 20:15:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:15:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:15:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2023-08-29 20:15:49,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4526829268292683 [2023-08-29 20:15:49,681 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 464 transitions. [2023-08-29 20:15:49,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 464 transitions. [2023-08-29 20:15:49,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:49,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 464 transitions. [2023-08-29 20:15:49,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:15:49,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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:15:49,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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:15:49,685 INFO L175 Difference]: Start difference. First operand has 46 places, 25 transitions, 140 flow. Second operand 5 states and 464 transitions. [2023-08-29 20:15:49,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 339 flow [2023-08-29 20:15:49,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 320 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-29 20:15:49,687 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 162 flow [2023-08-29 20:15:49,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:15:49,688 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-08-29 20:15:49,688 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 162 flow [2023-08-29 20:15:49,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:15:49,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:49,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:49,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:15:49,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:49,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -998732064, now seen corresponding path program 1 times [2023-08-29 20:15:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900186806] [2023-08-29 20:15:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:50,132 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:15:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:50,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900186806] [2023-08-29 20:15:50,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900186806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:50,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:50,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:15:50,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333744260] [2023-08-29 20:15:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:50,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:15:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:15:50,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:15:50,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 205 [2023-08-29 20:15:50,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 80.55555555555556) internal successors, (725), 9 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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:15:50,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:50,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 205 [2023-08-29 20:15:50,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:50,488 INFO L130 PetriNetUnfolder]: 293/633 cut-off events. [2023-08-29 20:15:50,488 INFO L131 PetriNetUnfolder]: For 644/644 co-relation queries the response was YES. [2023-08-29 20:15:50,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 633 events. 293/633 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3315 event pairs, 75 based on Foata normal form. 20/653 useless extension candidates. Maximal degree in co-relation 2164. Up to 288 conditions per place. [2023-08-29 20:15:50,492 INFO L137 encePairwiseOnDemand]: 195/205 looper letters, 33 selfloop transitions, 18 changer transitions 33/84 dead transitions. [2023-08-29 20:15:50,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 588 flow [2023-08-29 20:15:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:15:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:15:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 939 transitions. [2023-08-29 20:15:50,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4164079822616408 [2023-08-29 20:15:50,497 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 939 transitions. [2023-08-29 20:15:50,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 939 transitions. [2023-08-29 20:15:50,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:50,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 939 transitions. [2023-08-29 20:15:50,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 85.36363636363636) internal successors, (939), 11 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:50,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 205.0) internal successors, (2460), 12 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states 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:15:50,503 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 205.0) internal successors, (2460), 12 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states 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:15:50,503 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 162 flow. Second operand 11 states and 939 transitions. [2023-08-29 20:15:50,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 588 flow [2023-08-29 20:15:50,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:15:50,507 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 265 flow [2023-08-29 20:15:50,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=265, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-08-29 20:15:50,508 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2023-08-29 20:15:50,508 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 265 flow [2023-08-29 20:15:50,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.55555555555556) internal successors, (725), 9 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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:15:50,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:50,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:50,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:15:50,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:50,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash -345469996, now seen corresponding path program 2 times [2023-08-29 20:15:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186036452] [2023-08-29 20:15:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:15:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186036452] [2023-08-29 20:15:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186036452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:15:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818976004] [2023-08-29 20:15:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:50,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:15:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:15:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:15:51,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 205 [2023-08-29 20:15:51,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 265 flow. Second operand has 9 states, 9 states have (on average 80.55555555555556) internal successors, (725), 9 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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:15:51,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:51,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 205 [2023-08-29 20:15:51,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:51,313 INFO L130 PetriNetUnfolder]: 141/349 cut-off events. [2023-08-29 20:15:51,313 INFO L131 PetriNetUnfolder]: For 675/675 co-relation queries the response was YES. [2023-08-29 20:15:51,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 349 events. 141/349 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1693 event pairs, 10 based on Foata normal form. 12/361 useless extension candidates. Maximal degree in co-relation 1421. Up to 173 conditions per place. [2023-08-29 20:15:51,316 INFO L137 encePairwiseOnDemand]: 195/205 looper letters, 40 selfloop transitions, 24 changer transitions 8/72 dead transitions. [2023-08-29 20:15:51,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 602 flow [2023-08-29 20:15:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:15:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:15:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 849 transitions. [2023-08-29 20:15:51,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4141463414634146 [2023-08-29 20:15:51,319 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 849 transitions. [2023-08-29 20:15:51,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 849 transitions. [2023-08-29 20:15:51,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:51,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 849 transitions. [2023-08-29 20:15:51,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.9) internal successors, (849), 10 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:15:51,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states 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:15:51,324 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states 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:15:51,324 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 265 flow. Second operand 10 states and 849 transitions. [2023-08-29 20:15:51,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 602 flow [2023-08-29 20:15:51,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 567 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-08-29 20:15:51,329 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 385 flow [2023-08-29 20:15:51,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=385, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-29 20:15:51,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2023-08-29 20:15:51,329 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 385 flow [2023-08-29 20:15:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.55555555555556) internal successors, (725), 9 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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:15:51,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:51,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:51,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:15:51,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:51,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -168796358, now seen corresponding path program 3 times [2023-08-29 20:15:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534387867] [2023-08-29 20:15:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:51,483 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:15:51,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:51,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534387867] [2023-08-29 20:15:51,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534387867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:51,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:51,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:15:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106901968] [2023-08-29 20:15:51,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:51,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:15:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:15:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:15:51,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 205 [2023-08-29 20:15:51,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:15:51,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:51,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 205 [2023-08-29 20:15:51,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:51,599 INFO L130 PetriNetUnfolder]: 74/221 cut-off events. [2023-08-29 20:15:51,599 INFO L131 PetriNetUnfolder]: For 391/399 co-relation queries the response was YES. [2023-08-29 20:15:51,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 221 events. 74/221 cut-off events. For 391/399 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1034 event pairs, 6 based on Foata normal form. 32/250 useless extension candidates. Maximal degree in co-relation 940. Up to 81 conditions per place. [2023-08-29 20:15:51,601 INFO L137 encePairwiseOnDemand]: 200/205 looper letters, 36 selfloop transitions, 6 changer transitions 20/68 dead transitions. [2023-08-29 20:15:51,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 648 flow [2023-08-29 20:15:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:15:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:15:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-08-29 20:15:51,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2023-08-29 20:15:51,604 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-08-29 20:15:51,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-08-29 20:15:51,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:51,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-08-29 20:15:51,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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:15:51,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states 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:15:51,609 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states 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:15:51,609 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 385 flow. Second operand 6 states and 540 transitions. [2023-08-29 20:15:51,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 648 flow [2023-08-29 20:15:51,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 583 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-08-29 20:15:51,613 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 303 flow [2023-08-29 20:15:51,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2023-08-29 20:15:51,614 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2023-08-29 20:15:51,614 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 303 flow [2023-08-29 20:15:51,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:15:51,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:51,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:51,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:15:51,615 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:51,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1180721407, now seen corresponding path program 1 times [2023-08-29 20:15:51,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:51,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313726765] [2023-08-29 20:15:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:15:52,183 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:15:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:15:52,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313726765] [2023-08-29 20:15:52,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313726765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:15:52,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:15:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:15:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338280853] [2023-08-29 20:15:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:15:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:15:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:15:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:15:52,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:15:52,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 205 [2023-08-29 20:15:52,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:15:52,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:15:52,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 205 [2023-08-29 20:15:52,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:15:52,413 INFO L130 PetriNetUnfolder]: 54/202 cut-off events. [2023-08-29 20:15:52,413 INFO L131 PetriNetUnfolder]: For 471/477 co-relation queries the response was YES. [2023-08-29 20:15:52,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 202 events. 54/202 cut-off events. For 471/477 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 985 event pairs, 5 based on Foata normal form. 2/203 useless extension candidates. Maximal degree in co-relation 907. Up to 84 conditions per place. [2023-08-29 20:15:52,415 INFO L137 encePairwiseOnDemand]: 199/205 looper letters, 19 selfloop transitions, 5 changer transitions 32/58 dead transitions. [2023-08-29 20:15:52,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 519 flow [2023-08-29 20:15:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:15:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:15:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 630 transitions. [2023-08-29 20:15:52,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2023-08-29 20:15:52,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 630 transitions. [2023-08-29 20:15:52,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 630 transitions. [2023-08-29 20:15:52,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:15:52,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 630 transitions. [2023-08-29 20:15:52,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:15:52,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states 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:15:52,422 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states 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:15:52,422 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 303 flow. Second operand 7 states and 630 transitions. [2023-08-29 20:15:52,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 519 flow [2023-08-29 20:15:52,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 458 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-08-29 20:15:52,426 INFO L231 Difference]: Finished difference. Result has 61 places, 23 transitions, 153 flow [2023-08-29 20:15:52,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=23} [2023-08-29 20:15:52,428 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-08-29 20:15:52,428 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 23 transitions, 153 flow [2023-08-29 20:15:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:15:52,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:15:52,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:52,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:15:52,429 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:15:52,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:15:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -267976273, now seen corresponding path program 2 times [2023-08-29 20:15:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:15:52,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973091625] [2023-08-29 20:15:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:15:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:15:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:15:52,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:15:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:15:52,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:15:52,558 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:15:52,559 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:15:52,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:15:52,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:15:52,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:15:52,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:15:52,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:15:52,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:15:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:15:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:15:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:15:52,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:15:52,566 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:15:52,573 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:15:52,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:15:52,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:15:52 BasicIcfg [2023-08-29 20:15:52,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:15:52,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:15:52,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:15:52,639 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:15:52,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:15:42" (3/4) ... [2023-08-29 20:15:52,641 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:15:52,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:15:52,642 INFO L158 Benchmark]: Toolchain (without parser) took 10961.51ms. Allocated memory was 73.4MB in the beginning and 228.6MB in the end (delta: 155.2MB). Free memory was 49.6MB in the beginning and 180.2MB in the end (delta: -130.6MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,642 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:15:52,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.95ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 49.4MB in the beginning and 70.2MB in the end (delta: -20.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.86ms. Allocated memory is still 98.6MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,643 INFO L158 Benchmark]: Boogie Preprocessor took 28.41ms. Allocated memory is still 98.6MB. Free memory was 67.7MB in the beginning and 66.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,643 INFO L158 Benchmark]: RCFGBuilder took 670.65ms. Allocated memory is still 98.6MB. Free memory was 66.0MB in the beginning and 59.7MB in the end (delta: 6.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,643 INFO L158 Benchmark]: TraceAbstraction took 9719.19ms. Allocated memory was 98.6MB in the beginning and 228.6MB in the end (delta: 130.0MB). Free memory was 59.1MB in the beginning and 181.3MB in the end (delta: -122.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,644 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 228.6MB. Free memory was 181.3MB in the beginning and 180.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:15:52,645 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.19ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.95ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 49.4MB in the beginning and 70.2MB in the end (delta: -20.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.86ms. Allocated memory is still 98.6MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.41ms. Allocated memory is still 98.6MB. Free memory was 67.7MB in the beginning and 66.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 670.65ms. Allocated memory is still 98.6MB. Free memory was 66.0MB in the beginning and 59.7MB in the end (delta: 6.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9719.19ms. Allocated memory was 98.6MB in the beginning and 228.6MB in the end (delta: 130.0MB). Free memory was 59.1MB in the beginning and 181.3MB in the end (delta: -122.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 228.6MB. Free memory was 181.3MB in the beginning and 180.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 105 PlacesBefore, 32 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1420 CoEnabledTransitionPairs, 6 FixpointIterations, 51 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 3655 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1744, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 784, independent: 747, independent conditional: 0, independent unconditional: 747, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1744, independent: 855, independent conditional: 0, independent unconditional: 855, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 784, unknown conditional: 0, unknown unconditional: 784] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241, ((void *)0), P0, ((void *)0))=-1, t241={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t242; [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t242, ((void *)0), P1, ((void *)0))=0, t241={5:0}, t242={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 [L758] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 2 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241={5:0}, t242={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L840] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 820]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 825]: 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 5 procedures, 123 locations, 10 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: 9.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 572 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1498 IncrementalHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 84 mSDtfsCounter, 1498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 1350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:15:52,665 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/mix009.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 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 --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:15:54,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:15:54,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:15:54,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:15:54,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:15:54,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:15:54,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:15:54,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:15:54,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:15:54,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:15:54,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:15:54,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:15:54,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:15:54,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:15:54,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:15:54,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:15:54,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:15:54,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:15:54,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:15:54,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:15:54,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:15:54,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:15:54,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:15:54,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:15:54,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:15:54,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:15:54,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:15:54,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:15:54,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:15:54,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:15:54,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:15:54,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:15:54,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:15:54,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:15:54,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:15:54,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:15:54,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:15:54,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:15:54,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:15:54,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:15:54,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:15:54,538 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:15:54,574 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:15:54,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:15:54,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:15:54,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:15:54,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:15:54,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:15:54,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:15:54,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:15:54,577 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:15:54,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:15:54,578 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:15:54,578 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:15:54,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:15:54,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:15:54,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:15:54,579 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:15:54,579 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:15:54,579 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:15:54,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:15:54,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:15:54,580 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:15:54,580 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:15:54,580 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:15:54,580 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:15:54,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:15:54,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:15:54,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:15:54,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:15:54,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:15:54,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:15:54,582 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:15:54,582 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:15:54,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:15:54,582 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:15:54,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:15:54,582 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:15:54,583 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:15:54,583 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 -> 4dcfd24df13a4fc35e028ca53c41591d13aa2fa957261180f0dd9c1764b57d13 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:15:54,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:15:54,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:15:54,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:15:54,904 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:15:54,904 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:15:54,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2023-08-29 20:15:56,055 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:15:56,325 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:15:56,326 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2023-08-29 20:15:56,346 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d30ea5c/6f17428f83e34e21a55348a39ce98227/FLAGde62f2ab7 [2023-08-29 20:15:56,364 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d30ea5c/6f17428f83e34e21a55348a39ce98227 [2023-08-29 20:15:56,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:15:56,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:15:56,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:15:56,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:15:56,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:15:56,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:56,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f927cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56, skipping insertion in model container [2023-08-29 20:15:56,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:56,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:15:56,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:15:56,596 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/mix009.oepc.i[945,958] [2023-08-29 20:15:56,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:15:56,837 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:15:56,850 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/mix009.oepc.i[945,958] [2023-08-29 20:15:56,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:15:56,941 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:15:56,942 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:15:56,947 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:15:56,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56 WrapperNode [2023-08-29 20:15:56,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:15:56,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:15:56,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:15:56,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:15:56,956 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:15:56" (1/1) ... [2023-08-29 20:15:56,990 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:15:56" (1/1) ... [2023-08-29 20:15:57,027 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-08-29 20:15:57,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:15:57,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:15:57,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:15:57,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:15:57,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,076 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:15:57,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:15:57,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:15:57,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:15:57,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (1/1) ... [2023-08-29 20:15:57,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:15:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:15:57,117 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:15:57,144 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:15:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:15:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:15:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:15:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:15:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:15:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:15:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:15:57,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:15:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:15:57,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:15:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:15:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:15:57,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:15:57,162 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:15:57,370 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:15:57,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:15:57,610 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:15:57,712 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:15:57,712 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:15:57,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:15:57 BoogieIcfgContainer [2023-08-29 20:15:57,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:15:57,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:15:57,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:15:57,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:15:57,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:15:56" (1/3) ... [2023-08-29 20:15:57,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b4444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:15:57, skipping insertion in model container [2023-08-29 20:15:57,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:15:56" (2/3) ... [2023-08-29 20:15:57,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b4444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:15:57, skipping insertion in model container [2023-08-29 20:15:57,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:15:57" (3/3) ... [2023-08-29 20:15:57,721 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2023-08-29 20:15:57,751 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:15:57,751 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:15:57,751 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:15:57,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:15:57,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 216 flow [2023-08-29 20:15:57,900 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2023-08-29 20:15:57,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:15:57,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-29 20:15:57,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 103 transitions, 216 flow [2023-08-29 20:15:57,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 101 transitions, 208 flow [2023-08-29 20:15:57,914 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:15:57,926 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 101 transitions, 208 flow [2023-08-29 20:15:57,930 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 101 transitions, 208 flow [2023-08-29 20:15:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 101 transitions, 208 flow [2023-08-29 20:15:57,968 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2023-08-29 20:15:57,968 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:15:57,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-29 20:15:57,971 INFO L119 LiptonReduction]: Number of co-enabled transitions 1420 [2023-08-29 20:16:03,179 INFO L134 LiptonReduction]: Checked pairs total: 3906 [2023-08-29 20:16:03,179 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-29 20:16:03,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:16:03,196 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;@33226968, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:16:03,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:16:03,198 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:16:03,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:03,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:03,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:16:03,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:03,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 463, now seen corresponding path program 1 times [2023-08-29 20:16:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209842573] [2023-08-29 20:16:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:03,220 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:16:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:03,224 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:16:03,261 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:16:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:03,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:16:03,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:03,311 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:03,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:03,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209842573] [2023-08-29 20:16:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209842573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:03,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:03,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:16:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431917721] [2023-08-29 20:16:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:03,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:16:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:16:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:16:03,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 207 [2023-08-29 20:16:03,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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:03,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:03,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 207 [2023-08-29 20:16:03,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:03,602 INFO L130 PetriNetUnfolder]: 324/560 cut-off events. [2023-08-29 20:16:03,603 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:16:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 560 events. 324/560 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2374 event pairs, 324 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 1115. Up to 548 conditions per place. [2023-08-29 20:16:03,612 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-29 20:16:03,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-08-29 20:16:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:16:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:16:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2023-08-29 20:16:03,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024154589371981 [2023-08-29 20:16:03,627 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 208 transitions. [2023-08-29 20:16:03,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 208 transitions. [2023-08-29 20:16:03,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:03,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 208 transitions. [2023-08-29 20:16:03,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 104.0) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:03,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:03,641 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:03,643 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 208 transitions. [2023-08-29 20:16:03,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-08-29 20:16:03,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:16:03,647 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-08-29 20:16:03,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-29 20:16:03,654 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-29 20:16:03,654 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-08-29 20:16:03,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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:03,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:03,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:16:03,667 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 (2)] Ended with exit code 0 [2023-08-29 20:16:03,864 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:16:03,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:03,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 457452, now seen corresponding path program 1 times [2023-08-29 20:16:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498234247] [2023-08-29 20:16:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:03,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:16:03,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:03,872 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:16:03,876 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:16:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:03,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:16:03,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:03,966 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:03,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:03,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:03,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498234247] [2023-08-29 20:16:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498234247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:03,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:03,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:16:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710044482] [2023-08-29 20:16:03,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:03,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:16:03,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:16:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:16:03,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 207 [2023-08-29 20:16:03,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:03,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:03,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 207 [2023-08-29 20:16:03,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:04,098 INFO L130 PetriNetUnfolder]: 264/468 cut-off events. [2023-08-29 20:16:04,099 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:16:04,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 468 events. 264/468 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1989 event pairs, 87 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 930. Up to 389 conditions per place. [2023-08-29 20:16:04,101 INFO L137 encePairwiseOnDemand]: 204/207 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-29 20:16:04,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 130 flow [2023-08-29 20:16:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:16:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:16:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-29 20:16:04,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895330112721417 [2023-08-29 20:16:04,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-29 20:16:04,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-29 20:16:04,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:04,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-29 20:16:04,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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:04,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:04,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states 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:04,112 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 304 transitions. [2023-08-29 20:16:04,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 130 flow [2023-08-29 20:16:04,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:16:04,114 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 46 flow [2023-08-29 20:16:04,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-08-29 20:16:04,115 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-08-29 20:16:04,115 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 46 flow [2023-08-29 20:16:04,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:04,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:04,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:04,127 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:16:04,324 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:16:04,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:04,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1269757357, now seen corresponding path program 1 times [2023-08-29 20:16:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:04,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073380932] [2023-08-29 20:16:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:04,327 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:16:04,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:04,328 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:16:04,349 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:16:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:04,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:16:04,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:04,471 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:04,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:04,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073380932] [2023-08-29 20:16:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073380932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:16:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749155626] [2023-08-29 20:16:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:04,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:16:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:16:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:16:04,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 207 [2023-08-29 20:16:04,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:04,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:04,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 207 [2023-08-29 20:16:04,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:04,592 INFO L130 PetriNetUnfolder]: 95/212 cut-off events. [2023-08-29 20:16:04,592 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 20:16:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 212 events. 95/212 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 801 event pairs, 39 based on Foata normal form. 25/226 useless extension candidates. Maximal degree in co-relation 443. Up to 86 conditions per place. [2023-08-29 20:16:04,593 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 31 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2023-08-29 20:16:04,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 162 flow [2023-08-29 20:16:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:16:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:16:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2023-08-29 20:16:04,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46618357487922707 [2023-08-29 20:16:04,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2023-08-29 20:16:04,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2023-08-29 20:16:04,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:04,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2023-08-29 20:16:04,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:16:04,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states 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:04,599 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states 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:04,599 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 46 flow. Second operand 4 states and 386 transitions. [2023-08-29 20:16:04,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 162 flow [2023-08-29 20:16:04,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:16:04,601 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 68 flow [2023-08-29 20:16:04,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-29 20:16:04,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-29 20:16:04,602 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 68 flow [2023-08-29 20:16:04,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:04,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:04,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:04,613 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:16:04,811 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:16:04,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:04,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 407909054, now seen corresponding path program 1 times [2023-08-29 20:16:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292313939] [2023-08-29 20:16:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:04,813 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:16:04,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:04,819 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:16:04,820 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:16:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:04,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:16:04,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:04,960 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:04,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:04,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:04,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292313939] [2023-08-29 20:16:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292313939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:04,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:04,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:16:04,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330792052] [2023-08-29 20:16:04,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:04,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:16:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:16:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:16:04,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 207 [2023-08-29 20:16:04,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states 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:04,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:04,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 207 [2023-08-29 20:16:04,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:05,067 INFO L130 PetriNetUnfolder]: 31/88 cut-off events. [2023-08-29 20:16:05,067 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 20:16:05,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 88 events. 31/88 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 15 based on Foata normal form. 9/95 useless extension candidates. Maximal degree in co-relation 226. Up to 40 conditions per place. [2023-08-29 20:16:05,069 INFO L137 encePairwiseOnDemand]: 202/207 looper letters, 21 selfloop transitions, 6 changer transitions 1/30 dead transitions. [2023-08-29 20:16:05,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 147 flow [2023-08-29 20:16:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:16:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:16:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2023-08-29 20:16:05,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2023-08-29 20:16:05,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2023-08-29 20:16:05,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2023-08-29 20:16:05,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:05,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2023-08-29 20:16:05,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states 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:05,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 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:16:05,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 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:16:05,075 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 68 flow. Second operand 5 states and 465 transitions. [2023-08-29 20:16:05,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 147 flow [2023-08-29 20:16:05,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 138 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:16:05,078 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 84 flow [2023-08-29 20:16:05,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2023-08-29 20:16:05,080 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-29 20:16:05,080 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 84 flow [2023-08-29 20:16:05,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states 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:05,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:05,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:05,093 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:16:05,290 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:16:05,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:05,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1879022072, now seen corresponding path program 1 times [2023-08-29 20:16:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527148282] [2023-08-29 20:16:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:05,292 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:16:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:05,294 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:16:05,296 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:16:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:05,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 20:16:05,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:05,588 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:05,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:05,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527148282] [2023-08-29 20:16:05,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527148282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:05,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:16:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344964586] [2023-08-29 20:16:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:05,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:16:05,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:05,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:16:05,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:16:05,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 207 [2023-08-29 20:16:05,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:05,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:05,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 207 [2023-08-29 20:16:05,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:05,821 INFO L130 PetriNetUnfolder]: 25/84 cut-off events. [2023-08-29 20:16:05,822 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-29 20:16:05,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 84 events. 25/84 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 226 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 235. Up to 26 conditions per place. [2023-08-29 20:16:05,822 INFO L137 encePairwiseOnDemand]: 200/207 looper letters, 33 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-08-29 20:16:05,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 256 flow [2023-08-29 20:16:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:16:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:16:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 717 transitions. [2023-08-29 20:16:05,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329710144927536 [2023-08-29 20:16:05,829 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 717 transitions. [2023-08-29 20:16:05,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 717 transitions. [2023-08-29 20:16:05,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:05,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 717 transitions. [2023-08-29 20:16:05,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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:05,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states 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:05,835 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states 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:05,835 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 84 flow. Second operand 8 states and 717 transitions. [2023-08-29 20:16:05,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 256 flow [2023-08-29 20:16:05,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 190 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-29 20:16:05,839 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 86 flow [2023-08-29 20:16:05,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-29 20:16:05,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-08-29 20:16:05,841 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 86 flow [2023-08-29 20:16:05,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 states have internal predecessors, (611), 0 states have call successors, (0), 0 states 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:05,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:05,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:05,855 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:16:06,055 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:16:06,056 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:06,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1743928316, now seen corresponding path program 2 times [2023-08-29 20:16:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:06,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673585819] [2023-08-29 20:16:06,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:16:06,057 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:16:06,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:06,058 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:16:06,061 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:16:06,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:16:06,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:16:06,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:16:06,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:06,197 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:06,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:06,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673585819] [2023-08-29 20:16:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673585819] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:06,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:16:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449315525] [2023-08-29 20:16:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:06,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:16:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:06,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:16:06,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:16:06,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 207 [2023-08-29 20:16:06,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:06,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:06,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 207 [2023-08-29 20:16:06,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:06,350 INFO L130 PetriNetUnfolder]: 37/127 cut-off events. [2023-08-29 20:16:06,350 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-08-29 20:16:06,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 127 events. 37/127 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 431 event pairs, 15 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 332. Up to 56 conditions per place. [2023-08-29 20:16:06,351 INFO L137 encePairwiseOnDemand]: 203/207 looper letters, 38 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-29 20:16:06,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 243 flow [2023-08-29 20:16:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:16:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:16:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-08-29 20:16:06,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45217391304347826 [2023-08-29 20:16:06,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-08-29 20:16:06,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-08-29 20:16:06,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:06,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-08-29 20:16:06,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states 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:06,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 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:16:06,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 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:16:06,358 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 86 flow. Second operand 5 states and 468 transitions. [2023-08-29 20:16:06,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 243 flow [2023-08-29 20:16:06,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:16:06,360 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 115 flow [2023-08-29 20:16:06,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-29 20:16:06,362 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-29 20:16:06,362 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 115 flow [2023-08-29 20:16:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:06,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:06,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:06,379 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:16:06,574 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:16:06,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:06,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -205106676, now seen corresponding path program 1 times [2023-08-29 20:16:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372628763] [2023-08-29 20:16:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:16:06,577 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:16:06,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:06,578 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:16:06,582 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:16:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:16:06,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:16:06,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:16:06,924 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:06,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:16:06,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:16:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372628763] [2023-08-29 20:16:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372628763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:16:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:16:06,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:16:06,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258730507] [2023-08-29 20:16:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:16:06,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:16:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:16:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:16:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:16:07,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 207 [2023-08-29 20:16:07,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:07,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:16:07,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 207 [2023-08-29 20:16:07,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:16:07,129 INFO L130 PetriNetUnfolder]: 32/111 cut-off events. [2023-08-29 20:16:07,129 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 20:16:07,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 111 events. 32/111 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 371 event pairs, 14 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 303. Up to 99 conditions per place. [2023-08-29 20:16:07,130 INFO L137 encePairwiseOnDemand]: 204/207 looper letters, 18 selfloop transitions, 2 changer transitions 8/30 dead transitions. [2023-08-29 20:16:07,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 179 flow [2023-08-29 20:16:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:16:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:16:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 341 transitions. [2023-08-29 20:16:07,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41183574879227053 [2023-08-29 20:16:07,135 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 341 transitions. [2023-08-29 20:16:07,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 341 transitions. [2023-08-29 20:16:07,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:16:07,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 341 transitions. [2023-08-29 20:16:07,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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:07,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states 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:07,138 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states 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:07,138 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 115 flow. Second operand 4 states and 341 transitions. [2023-08-29 20:16:07,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 179 flow [2023-08-29 20:16:07,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:16:07,140 INFO L231 Difference]: Finished difference. Result has 42 places, 20 transitions, 74 flow [2023-08-29 20:16:07,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=20} [2023-08-29 20:16:07,141 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-29 20:16:07,141 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 20 transitions, 74 flow [2023-08-29 20:16:07,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:07,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:16:07,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:16:07,151 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:16:07,349 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:16:07,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:16:07,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:16:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -946407548, now seen corresponding path program 3 times [2023-08-29 20:16:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:16:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52289411] [2023-08-29 20:16:07,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:16:07,350 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:16:07,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:16:07,351 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:16:07,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:16:07,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:16:07,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:16:07,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:16:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:16:07,542 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:16:07,542 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:16:07,543 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:16:07,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:16:07,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:16:07,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:16:07,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:16:07,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:16:07,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:16:07,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:16:07,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:16:07,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:16:07,559 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:16:07,746 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:16:07,746 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-29 20:16:07,750 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:16:07,750 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:16:07,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:16:07 BasicIcfg [2023-08-29 20:16:07,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:16:07,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:16:07,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:16:07,793 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:16:07,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:15:57" (3/4) ... [2023-08-29 20:16:07,795 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:16:07,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:16:07,796 INFO L158 Benchmark]: Toolchain (without parser) took 11427.54ms. Allocated memory was 81.8MB in the beginning and 117.4MB in the end (delta: 35.7MB). Free memory was 55.2MB in the beginning and 66.7MB in the end (delta: -11.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-08-29 20:16:07,796 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:16:07,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.34ms. Allocated memory is still 81.8MB. Free memory was 55.0MB in the beginning and 50.8MB in the end (delta: 4.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2023-08-29 20:16:07,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.54ms. Allocated memory is still 81.8MB. Free memory was 50.8MB in the beginning and 48.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:16:07,797 INFO L158 Benchmark]: Boogie Preprocessor took 56.02ms. Allocated memory is still 81.8MB. Free memory was 48.1MB in the beginning and 46.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:16:07,798 INFO L158 Benchmark]: RCFGBuilder took 629.35ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 32.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-08-29 20:16:07,798 INFO L158 Benchmark]: TraceAbstraction took 10076.47ms. Allocated memory was 81.8MB in the beginning and 117.4MB in the end (delta: 35.7MB). Free memory was 31.5MB in the beginning and 66.7MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:16:07,798 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 117.4MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:16:07,800 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.18ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.34ms. Allocated memory is still 81.8MB. Free memory was 55.0MB in the beginning and 50.8MB in the end (delta: 4.3MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.54ms. Allocated memory is still 81.8MB. Free memory was 50.8MB in the beginning and 48.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.02ms. Allocated memory is still 81.8MB. Free memory was 48.1MB in the beginning and 46.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.35ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 32.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10076.47ms. Allocated memory was 81.8MB in the beginning and 117.4MB in the end (delta: 35.7MB). Free memory was 31.5MB in the beginning and 66.7MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 117.4MB. Free memory is still 66.7MB. 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: 5.2s, 106 PlacesBefore, 32 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1420 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 3906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2015, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 752, independent: 725, independent conditional: 0, independent unconditional: 725, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2015, independent: 1131, independent conditional: 0, independent unconditional: 1131, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 752, unknown conditional: 0, unknown unconditional: 752] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241, ((void *)0), P0, ((void *)0))=0, t241={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 [L758] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t242; [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t242, ((void *)0), P1, ((void *)0))=1, t241={3:0}, t242={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 2 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241={3:0}, t242={7:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241={3:0}, t242={7:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L840] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 820]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 825]: 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 5 procedures, 124 locations, 10 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: 9.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 12 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 31, 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.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 15 QuantifiedInterpolants, 615 SizeOfPredicates, 7 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:16:07,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample