./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.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/mix031.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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --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:23:46,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:23:46,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:23:46,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:23:46,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:23:46,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:23:46,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:23:46,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:23:46,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:23:46,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:23:46,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:23:46,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:23:46,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:23:46,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:23:46,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:23:46,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:23:46,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:23:46,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:23:46,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:23:46,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:23:46,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:23:46,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:23:46,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:23:46,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:23:46,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:23:46,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:23:46,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:23:46,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:23:46,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:23:46,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:23:46,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:23:46,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:23:46,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:23:46,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:23:46,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:23:46,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:23:46,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:23:46,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:23:46,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:23:46,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:23:46,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:23:46,977 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:23:47,009 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:23:47,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:23:47,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:23:47,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:23:47,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:23:47,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:23:47,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:23:47,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:23:47,013 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:23:47,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:23:47,014 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:23:47,014 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:23:47,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:23:47,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:23:47,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:23:47,015 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:23:47,015 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:23:47,015 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:23:47,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:23:47,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:23:47,016 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:23:47,016 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:23:47,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:23:47,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:23:47,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:23:47,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:47,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:23:47,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:23:47,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:23:47,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:23:47,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:23:47,018 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:23:47,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:23:47,018 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:23:47,018 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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf 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:23:47,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:23:47,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:23:47,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:23:47,352 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:23:47,353 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:23:47,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-29 20:23:48,558 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:23:48,793 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:23:48,793 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-29 20:23:48,808 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39435375c/62df1158626844999f06440061d7e0a7/FLAGb841cbc20 [2023-08-29 20:23:48,819 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39435375c/62df1158626844999f06440061d7e0a7 [2023-08-29 20:23:48,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:23:48,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:23:48,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:48,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:23:48,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:23:48,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:48" (1/1) ... [2023-08-29 20:23:48,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130534bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:48, skipping insertion in model container [2023-08-29 20:23:48,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:48" (1/1) ... [2023-08-29 20:23:48,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:23:48,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:23:48,989 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/mix031.oepc.i[945,958] [2023-08-29 20:23:49,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:49,206 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:23:49,217 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/mix031.oepc.i[945,958] [2023-08-29 20:23:49,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:49,310 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:49,310 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:49,324 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:23:49,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49 WrapperNode [2023-08-29 20:23:49,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:49,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:49,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:23:49,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:23:49,332 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:23:49" (1/1) ... [2023-08-29 20:23:49,361 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:23:49" (1/1) ... [2023-08-29 20:23:49,392 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-08-29 20:23:49,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:49,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:23:49,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:23:49,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:23:49,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,437 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:23:49,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:23:49,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:23:49,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:23:49,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (1/1) ... [2023-08-29 20:23:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:49,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:23:49,477 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:23:49,487 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:23:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:23:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:23:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:23:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:23:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:23:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:23:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:23:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:23:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:23:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:23:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:23:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:23:49,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:23:49,520 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:23:49,682 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:23:49,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:23:50,028 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:23:50,149 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:23:50,149 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:23:50,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:50 BoogieIcfgContainer [2023-08-29 20:23:50,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:23:50,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:23:50,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:23:50,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:23:50,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:23:48" (1/3) ... [2023-08-29 20:23:50,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75073229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:50, skipping insertion in model container [2023-08-29 20:23:50,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:49" (2/3) ... [2023-08-29 20:23:50,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75073229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:50, skipping insertion in model container [2023-08-29 20:23:50,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:50" (3/3) ... [2023-08-29 20:23:50,160 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-08-29 20:23:50,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:23:50,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:23:50,173 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:23:50,208 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:23:50,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 218 flow [2023-08-29 20:23:50,283 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-08-29 20:23:50,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:50,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-29 20:23:50,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 104 transitions, 218 flow [2023-08-29 20:23:50,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 102 transitions, 210 flow [2023-08-29 20:23:50,295 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:23:50,303 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 102 transitions, 210 flow [2023-08-29 20:23:50,305 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 102 transitions, 210 flow [2023-08-29 20:23:50,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 102 transitions, 210 flow [2023-08-29 20:23:50,328 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-08-29 20:23:50,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:50,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-29 20:23:50,329 INFO L119 LiptonReduction]: Number of co-enabled transitions 1500 [2023-08-29 20:23:53,778 INFO L134 LiptonReduction]: Checked pairs total: 4292 [2023-08-29 20:23:53,779 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-29 20:23:53,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:23:53,811 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;@1f71784c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:23:53,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:23:53,813 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:23:53,813 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:53,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:53,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:23:53,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:23:53,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash 463, now seen corresponding path program 1 times [2023-08-29 20:23:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889554552] [2023-08-29 20:23:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:53,919 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:23:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:53,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889554552] [2023-08-29 20:23:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889554552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:53,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:23:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23568869] [2023-08-29 20:23:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:53,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:23:53,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:23:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:23:53,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-08-29 20:23:53,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:23:53,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:53,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-08-29 20:23:53,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:54,145 INFO L130 PetriNetUnfolder]: 304/529 cut-off events. [2023-08-29 20:23:54,146 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 20:23:54,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 529 events. 304/529 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2317 event pairs, 304 based on Foata normal form. 25/431 useless extension candidates. Maximal degree in co-relation 1050. Up to 516 conditions per place. [2023-08-29 20:23:54,187 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 19 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2023-08-29 20:23:54,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 88 flow [2023-08-29 20:23:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:23:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:23:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 210 transitions. [2023-08-29 20:23:54,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-29 20:23:54,199 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 210 transitions. [2023-08-29 20:23:54,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 210 transitions. [2023-08-29 20:23:54,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:54,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 210 transitions. [2023-08-29 20:23:54,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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:23:54,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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:23:54,240 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states 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:23:54,241 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 60 flow. Second operand 2 states and 210 transitions. [2023-08-29 20:23:54,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 88 flow [2023-08-29 20:23:54,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:54,245 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 48 flow [2023-08-29 20:23:54,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-29 20:23:54,249 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -5 predicate places. [2023-08-29 20:23:54,250 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 48 flow [2023-08-29 20:23:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:23:54,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:54,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:23:54,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:23:54,251 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:23:54,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash 454666, now seen corresponding path program 1 times [2023-08-29 20:23:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937999138] [2023-08-29 20:23:54,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:54,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:54,508 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:23:54,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937999138] [2023-08-29 20:23:54,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937999138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:54,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:54,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:23:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839352835] [2023-08-29 20:23:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:54,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:54,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 204 [2023-08-29 20:23:54,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:23:54,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:54,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 204 [2023-08-29 20:23:54,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:54,644 INFO L130 PetriNetUnfolder]: 235/443 cut-off events. [2023-08-29 20:23:54,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:54,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 443 events. 235/443 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1987 event pairs, 76 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 857. Up to 334 conditions per place. [2023-08-29 20:23:54,650 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 25 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2023-08-29 20:23:54,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 136 flow [2023-08-29 20:23:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-08-29 20:23:54,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032679738562091 [2023-08-29 20:23:54,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-08-29 20:23:54,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-08-29 20:23:54,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:54,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-08-29 20:23:54,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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:23:54,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:54,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:54,659 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 48 flow. Second operand 3 states and 308 transitions. [2023-08-29 20:23:54,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 136 flow [2023-08-29 20:23:54,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:23:54,660 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 46 flow [2023-08-29 20:23:54,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-08-29 20:23:54,661 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2023-08-29 20:23:54,661 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 46 flow [2023-08-29 20:23:54,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:23:54,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:54,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:54,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:23:54,662 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:23:54,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 462966050, now seen corresponding path program 1 times [2023-08-29 20:23:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812359406] [2023-08-29 20:23:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:54,969 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:23:54,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812359406] [2023-08-29 20:23:54,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812359406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:54,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:54,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425167498] [2023-08-29 20:23:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:55,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 204 [2023-08-29 20:23:55,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 46 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:23:55,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:55,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 204 [2023-08-29 20:23:55,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:55,117 INFO L130 PetriNetUnfolder]: 173/304 cut-off events. [2023-08-29 20:23:55,117 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-29 20:23:55,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 304 events. 173/304 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1128 event pairs, 140 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 649. Up to 297 conditions per place. [2023-08-29 20:23:55,119 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-29 20:23:55,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 90 flow [2023-08-29 20:23:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:23:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:23:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2023-08-29 20:23:55,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2023-08-29 20:23:55,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 348 transitions. [2023-08-29 20:23:55,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 348 transitions. [2023-08-29 20:23:55,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:55,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 348 transitions. [2023-08-29 20:23:55,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:23:55,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:23:55,124 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:23:55,124 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 46 flow. Second operand 4 states and 348 transitions. [2023-08-29 20:23:55,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 90 flow [2023-08-29 20:23:55,125 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:23:55,125 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-29 20:23:55,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-29 20:23:55,126 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -6 predicate places. [2023-08-29 20:23:55,126 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-29 20:23:55,127 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:23:55,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:55,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:55,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:23:55,127 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:23:55,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash 462966005, now seen corresponding path program 1 times [2023-08-29 20:23:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:55,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766054727] [2023-08-29 20:23:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:55,303 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:23:55,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:55,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766054727] [2023-08-29 20:23:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766054727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:55,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986741589] [2023-08-29 20:23:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:55,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:55,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 204 [2023-08-29 20:23:55,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:23:55,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:55,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 204 [2023-08-29 20:23:55,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:55,448 INFO L130 PetriNetUnfolder]: 287/508 cut-off events. [2023-08-29 20:23:55,448 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:23:55,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 508 events. 287/508 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1976 event pairs, 139 based on Foata normal form. 36/544 useless extension candidates. Maximal degree in co-relation 1037. Up to 417 conditions per place. [2023-08-29 20:23:55,451 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-29 20:23:55,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 176 flow [2023-08-29 20:23:55,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2023-08-29 20:23:55,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2023-08-29 20:23:55,453 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2023-08-29 20:23:55,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2023-08-29 20:23:55,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:55,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2023-08-29 20:23:55,455 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:23:55,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:23:55,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:23:55,458 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 468 transitions. [2023-08-29 20:23:55,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 176 flow [2023-08-29 20:23:55,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:55,459 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 68 flow [2023-08-29 20:23:55,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-08-29 20:23:55,460 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-29 20:23:55,460 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 68 flow [2023-08-29 20:23:55,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:23:55,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:55,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:55,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:23:55,461 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:23:55,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1479692083, now seen corresponding path program 1 times [2023-08-29 20:23:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380553619] [2023-08-29 20:23:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:55,782 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:23:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380553619] [2023-08-29 20:23:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380553619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177974819] [2023-08-29 20:23:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:55,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:23:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:23:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:23:55,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 204 [2023-08-29 20:23:55,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:23:55,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:55,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 204 [2023-08-29 20:23:55,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:56,002 INFO L130 PetriNetUnfolder]: 267/470 cut-off events. [2023-08-29 20:23:56,003 INFO L131 PetriNetUnfolder]: For 201/201 co-relation queries the response was YES. [2023-08-29 20:23:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 470 events. 267/470 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1768 event pairs, 41 based on Foata normal form. 28/498 useless extension candidates. Maximal degree in co-relation 1159. Up to 308 conditions per place. [2023-08-29 20:23:56,006 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 34 selfloop transitions, 9 changer transitions 17/60 dead transitions. [2023-08-29 20:23:56,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 299 flow [2023-08-29 20:23:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:23:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:23:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 725 transitions. [2023-08-29 20:23:56,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44424019607843135 [2023-08-29 20:23:56,008 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 725 transitions. [2023-08-29 20:23:56,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 725 transitions. [2023-08-29 20:23:56,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:56,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 725 transitions. [2023-08-29 20:23:56,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.625) internal successors, (725), 8 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:23:56,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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:23:56,015 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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:23:56,015 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 68 flow. Second operand 8 states and 725 transitions. [2023-08-29 20:23:56,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 299 flow [2023-08-29 20:23:56,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 283 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:56,020 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 127 flow [2023-08-29 20:23:56,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-29 20:23:56,022 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-08-29 20:23:56,022 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 127 flow [2023-08-29 20:23:56,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:23:56,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:56,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:56,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:23:56,023 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:23:56,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1691149853, now seen corresponding path program 1 times [2023-08-29 20:23:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230423626] [2023-08-29 20:23:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:56,202 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:23:56,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:56,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230423626] [2023-08-29 20:23:56,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230423626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:56,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:56,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371184833] [2023-08-29 20:23:56,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:56,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:56,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:56,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:56,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:56,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 204 [2023-08-29 20:23:56,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:23:56,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:56,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 204 [2023-08-29 20:23:56,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:56,320 INFO L130 PetriNetUnfolder]: 172/331 cut-off events. [2023-08-29 20:23:56,320 INFO L131 PetriNetUnfolder]: For 536/538 co-relation queries the response was YES. [2023-08-29 20:23:56,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 331 events. 172/331 cut-off events. For 536/538 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1299 event pairs, 54 based on Foata normal form. 20/343 useless extension candidates. Maximal degree in co-relation 971. Up to 194 conditions per place. [2023-08-29 20:23:56,323 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 25 selfloop transitions, 3 changer transitions 11/45 dead transitions. [2023-08-29 20:23:56,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 264 flow [2023-08-29 20:23:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-29 20:23:56,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774509803921569 [2023-08-29 20:23:56,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-29 20:23:56,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-29 20:23:56,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:56,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-29 20:23:56,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:23:56,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:23:56,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:23:56,328 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 127 flow. Second operand 5 states and 487 transitions. [2023-08-29 20:23:56,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 264 flow [2023-08-29 20:23:56,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 250 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:56,331 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 130 flow [2023-08-29 20:23:56,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-29 20:23:56,331 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2023-08-29 20:23:56,331 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 130 flow [2023-08-29 20:23:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:23:56,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:56,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:56,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:23:56,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:23:56,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 601446767, now seen corresponding path program 1 times [2023-08-29 20:23:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805586772] [2023-08-29 20:23:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:56,479 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:23:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805586772] [2023-08-29 20:23:56,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805586772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387213894] [2023-08-29 20:23:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:56,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:56,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:56,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 204 [2023-08-29 20:23:56,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:23:56,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:56,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 204 [2023-08-29 20:23:56,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:56,537 INFO L130 PetriNetUnfolder]: 45/115 cut-off events. [2023-08-29 20:23:56,537 INFO L131 PetriNetUnfolder]: For 136/137 co-relation queries the response was YES. [2023-08-29 20:23:56,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 115 events. 45/115 cut-off events. For 136/137 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 354 event pairs, 10 based on Foata normal form. 14/127 useless extension candidates. Maximal degree in co-relation 350. Up to 74 conditions per place. [2023-08-29 20:23:56,538 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-29 20:23:56,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 197 flow [2023-08-29 20:23:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-29 20:23:56,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820261437908497 [2023-08-29 20:23:56,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-29 20:23:56,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-29 20:23:56,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:56,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-29 20:23:56,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,542 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 130 flow. Second operand 3 states and 295 transitions. [2023-08-29 20:23:56,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 197 flow [2023-08-29 20:23:56,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 183 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-29 20:23:56,545 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 123 flow [2023-08-29 20:23:56,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=3, PETRI_FLOW=123, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:23:56,545 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-08-29 20:23:56,545 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 123 flow [2023-08-29 20:23:56,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:23:56,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:56,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:56,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:23:56,546 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:23:56,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1569313779, now seen corresponding path program 1 times [2023-08-29 20:23:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192601041] [2023-08-29 20:23:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:56,721 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:23:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192601041] [2023-08-29 20:23:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192601041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167767264] [2023-08-29 20:23:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:56,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:56,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:56,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 204 [2023-08-29 20:23:56,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 123 flow. Second operand has 4 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:23:56,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:56,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 204 [2023-08-29 20:23:56,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:56,775 INFO L130 PetriNetUnfolder]: 21/65 cut-off events. [2023-08-29 20:23:56,775 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-08-29 20:23:56,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 65 events. 21/65 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 6 based on Foata normal form. 8/71 useless extension candidates. Maximal degree in co-relation 208. Up to 33 conditions per place. [2023-08-29 20:23:56,776 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 21 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-08-29 20:23:56,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 198 flow [2023-08-29 20:23:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:23:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:23:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions. [2023-08-29 20:23:56,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47181372549019607 [2023-08-29 20:23:56,778 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 385 transitions. [2023-08-29 20:23:56,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions. [2023-08-29 20:23:56,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:56,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions. [2023-08-29 20:23:56,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:23:56,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:23:56,780 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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:23:56,780 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 123 flow. Second operand 4 states and 385 transitions. [2023-08-29 20:23:56,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 198 flow [2023-08-29 20:23:56,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 174 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 20:23:56,783 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 117 flow [2023-08-29 20:23:56,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:23:56,784 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-08-29 20:23:56,784 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 117 flow [2023-08-29 20:23:56,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:23:56,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:56,785 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:23:56,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:23:56,785 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:23:56,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1640443267, now seen corresponding path program 1 times [2023-08-29 20:23:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318371344] [2023-08-29 20:23:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:57,245 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:23:57,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318371344] [2023-08-29 20:23:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318371344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356764470] [2023-08-29 20:23:57,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:57,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:57,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:57,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:57,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-08-29 20:23:57,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:23:57,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:57,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-08-29 20:23:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:57,455 INFO L130 PetriNetUnfolder]: 44/122 cut-off events. [2023-08-29 20:23:57,455 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2023-08-29 20:23:57,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 122 events. 44/122 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 365 event pairs, 5 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 380. Up to 40 conditions per place. [2023-08-29 20:23:57,456 INFO L137 encePairwiseOnDemand]: 194/204 looper letters, 32 selfloop transitions, 11 changer transitions 15/58 dead transitions. [2023-08-29 20:23:57,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 368 flow [2023-08-29 20:23:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:23:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:23:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 700 transitions. [2023-08-29 20:23:57,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42892156862745096 [2023-08-29 20:23:57,458 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 700 transitions. [2023-08-29 20:23:57,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 700 transitions. [2023-08-29 20:23:57,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:57,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 700 transitions. [2023-08-29 20:23:57,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:23:57,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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:23:57,463 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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:23:57,463 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 117 flow. Second operand 8 states and 700 transitions. [2023-08-29 20:23:57,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 368 flow [2023-08-29 20:23:57,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 340 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:57,465 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 159 flow [2023-08-29 20:23:57,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-08-29 20:23:57,466 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-08-29 20:23:57,466 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 159 flow [2023-08-29 20:23:57,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.0) internal successors, (504), 6 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:23:57,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:57,467 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:23:57,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:23:57,467 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:23:57,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1550603325, now seen corresponding path program 2 times [2023-08-29 20:23:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:57,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885840431] [2023-08-29 20:23:57,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:57,710 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:23:57,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885840431] [2023-08-29 20:23:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885840431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147257677] [2023-08-29 20:23:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:57,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:57,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:57,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-08-29 20:23:57,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:23:57,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:57,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-08-29 20:23:57,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:57,799 INFO L130 PetriNetUnfolder]: 27/100 cut-off events. [2023-08-29 20:23:57,799 INFO L131 PetriNetUnfolder]: For 127/128 co-relation queries the response was YES. [2023-08-29 20:23:57,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 100 events. 27/100 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 335 event pairs, 8 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 357. Up to 38 conditions per place. [2023-08-29 20:23:57,800 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 17 selfloop transitions, 1 changer transitions 23/43 dead transitions. [2023-08-29 20:23:57,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 308 flow [2023-08-29 20:23:57,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 467 transitions. [2023-08-29 20:23:57,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45784313725490194 [2023-08-29 20:23:57,802 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 467 transitions. [2023-08-29 20:23:57,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 467 transitions. [2023-08-29 20:23:57,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:57,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 467 transitions. [2023-08-29 20:23:57,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:57,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:23:57,806 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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:23:57,806 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 159 flow. Second operand 5 states and 467 transitions. [2023-08-29 20:23:57,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 308 flow [2023-08-29 20:23:57,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 284 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-29 20:23:57,808 INFO L231 Difference]: Finished difference. Result has 46 places, 20 transitions, 98 flow [2023-08-29 20:23:57,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=20} [2023-08-29 20:23:57,809 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-08-29 20:23:57,809 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 20 transitions, 98 flow [2023-08-29 20:23:57,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:23:57,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:57,809 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:23:57,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:23:57,810 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:23:57,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1261642295, now seen corresponding path program 3 times [2023-08-29 20:23:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607275748] [2023-08-29 20:23:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:23:57,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:23:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:23:57,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:23:57,929 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:23:57,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:23:57,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:23:57,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:23:57,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:23:57,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:23:57,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:23:57,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:23:57,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:23:57,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:23:57,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:23:57,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:23:57,933 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:57,937 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:23:57,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:23:58,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:23:58 BasicIcfg [2023-08-29 20:23:58,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:23:58,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:23:58,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:23:58,005 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:23:58,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:50" (3/4) ... [2023-08-29 20:23:58,008 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:23:58,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:23:58,008 INFO L158 Benchmark]: Toolchain (without parser) took 9186.06ms. Allocated memory was 90.2MB in the beginning and 195.0MB in the end (delta: 104.9MB). Free memory was 69.3MB in the beginning and 143.5MB in the end (delta: -74.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2023-08-29 20:23:58,009 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 41.1MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:23:58,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.17ms. Allocated memory is still 90.2MB. Free memory was 69.3MB in the beginning and 68.6MB in the end (delta: 719.2kB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2023-08-29 20:23:58,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 90.2MB. Free memory was 68.6MB in the beginning and 66.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:58,009 INFO L158 Benchmark]: Boogie Preprocessor took 53.36ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 64.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:58,009 INFO L158 Benchmark]: RCFGBuilder took 704.58ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.8MB in the end (delta: 2.3MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2023-08-29 20:23:58,010 INFO L158 Benchmark]: TraceAbstraction took 7850.22ms. Allocated memory was 90.2MB in the beginning and 195.0MB in the end (delta: 104.9MB). Free memory was 60.7MB in the beginning and 143.5MB in the end (delta: -82.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-29 20:23:58,010 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 195.0MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:23:58,011 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 62.9MB. Free memory was 41.1MB in the beginning and 41.1MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.17ms. Allocated memory is still 90.2MB. Free memory was 69.3MB in the beginning and 68.6MB in the end (delta: 719.2kB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 90.2MB. Free memory was 68.6MB in the beginning and 66.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.36ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 64.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 704.58ms. Allocated memory is still 90.2MB. Free memory was 64.0MB in the beginning and 61.8MB in the end (delta: 2.3MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7850.22ms. Allocated memory was 90.2MB in the beginning and 195.0MB in the end (delta: 104.9MB). Free memory was 60.7MB in the beginning and 143.5MB in the end (delta: -82.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 195.0MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 107 PlacesBefore, 33 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 4292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2174, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 832, independent: 804, independent conditional: 0, independent unconditional: 804, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2174, independent: 1199, independent conditional: 0, independent unconditional: 1199, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 832, unknown conditional: 0, unknown unconditional: 832] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, 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; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-1, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t834, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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, 126 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: 7.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 21 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:23:58,033 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/mix031.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 c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf --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:23:59,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:23:59,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:23:59,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:23:59,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:23:59,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:23:59,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:23:59,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:23:59,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:23:59,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:23:59,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:23:59,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:23:59,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:23:59,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:23:59,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:23:59,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:23:59,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:23:59,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:23:59,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:23:59,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:23:59,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:23:59,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:23:59,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:23:59,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:23:59,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:23:59,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:23:59,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:23:59,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:23:59,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:23:59,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:23:59,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:23:59,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:23:59,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:23:59,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:23:59,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:23:59,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:23:59,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:23:59,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:23:59,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:23:59,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:23:59,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:23:59,954 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:23:59,985 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:23:59,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:23:59,987 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:23:59,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:23:59,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:23:59,988 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:23:59,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:23:59,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:23:59,988 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:23:59,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:23:59,989 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:23:59,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:23:59,990 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:23:59,991 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:23:59,991 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:23:59,991 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:23:59,991 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:23:59,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:23:59,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:23:59,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:23:59,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:59,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:23:59,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:23:59,992 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:23:59,992 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:23:59,992 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:23:59,993 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:23:59,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:23:59,993 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:23:59,993 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:23:59,993 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 -> c5191c614040da54c6fe77b0fb4d91d943009a345a9252a69568f58113a0aaaf 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:24:00,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:24:00,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:24:00,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:24:00,325 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:24:00,325 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:24:00,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-29 20:24:01,513 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:24:01,751 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:24:01,751 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-29 20:24:01,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd273a7d/79bb5c9f8fd2487da3e09cc454713f18/FLAGee8d1bcee [2023-08-29 20:24:01,787 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdd273a7d/79bb5c9f8fd2487da3e09cc454713f18 [2023-08-29 20:24:01,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:24:01,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:24:01,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:24:01,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:24:01,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:24:01,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:24:01" (1/1) ... [2023-08-29 20:24:01,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728bf3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:01, skipping insertion in model container [2023-08-29 20:24:01,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:24:01" (1/1) ... [2023-08-29 20:24:01,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:24:01,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:24:01,972 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/mix031.oepc.i[945,958] [2023-08-29 20:24:02,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:24:02,167 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:24:02,180 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/mix031.oepc.i[945,958] [2023-08-29 20:24:02,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:24:02,293 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:24:02,293 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:24:02,299 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:24:02,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02 WrapperNode [2023-08-29 20:24:02,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:24:02,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:24:02,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:24:02,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:24:02,307 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:24:02" (1/1) ... [2023-08-29 20:24:02,337 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:24:02" (1/1) ... [2023-08-29 20:24:02,365 INFO L138 Inliner]: procedures = 178, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2023-08-29 20:24:02,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:24:02,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:24:02,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:24:02,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:24:02,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,417 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:24:02,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:24:02,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:24:02,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:24:02,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (1/1) ... [2023-08-29 20:24:02,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:24:02,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:24:02,461 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:24:02,473 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:24:02,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:24:02,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:24:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:24:02,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:24:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:24:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:24:02,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:24:02,501 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:24:02,698 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:24:02,700 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:24:03,003 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:24:03,191 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:24:03,191 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:24:03,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:24:03 BoogieIcfgContainer [2023-08-29 20:24:03,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:24:03,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:24:03,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:24:03,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:24:03,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:24:01" (1/3) ... [2023-08-29 20:24:03,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5b52a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:24:03, skipping insertion in model container [2023-08-29 20:24:03,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:02" (2/3) ... [2023-08-29 20:24:03,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5b52a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:24:03, skipping insertion in model container [2023-08-29 20:24:03,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:24:03" (3/3) ... [2023-08-29 20:24:03,201 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-08-29 20:24:03,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:24:03,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:24:03,217 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:24:03,278 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:24:03,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 220 flow [2023-08-29 20:24:03,343 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-08-29 20:24:03,343 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:03,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-29 20:24:03,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 105 transitions, 220 flow [2023-08-29 20:24:03,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 103 transitions, 212 flow [2023-08-29 20:24:03,356 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:24:03,364 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 212 flow [2023-08-29 20:24:03,366 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 212 flow [2023-08-29 20:24:03,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 212 flow [2023-08-29 20:24:03,388 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-08-29 20:24:03,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:03,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-29 20:24:03,390 INFO L119 LiptonReduction]: Number of co-enabled transitions 1500 [2023-08-29 20:24:08,551 INFO L134 LiptonReduction]: Checked pairs total: 3979 [2023-08-29 20:24:08,551 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-29 20:24:08,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:24:08,568 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;@6e60c1d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:24:08,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:24:08,571 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:24:08,571 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:08,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:08,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:24:08,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:24:08,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 469, now seen corresponding path program 1 times [2023-08-29 20:24:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038277921] [2023-08-29 20:24:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:08,587 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:24:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:08,593 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:24:08,637 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:24:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:08,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:24:08,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:08,679 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:24:08,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:08,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038277921] [2023-08-29 20:24:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038277921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:24:08,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516445223] [2023-08-29 20:24:08,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:08,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:24:08,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:24:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:24:08,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 208 [2023-08-29 20:24:08,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 60 flow. Second operand has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:24:08,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:08,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 208 [2023-08-29 20:24:08,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:08,959 INFO L130 PetriNetUnfolder]: 304/529 cut-off events. [2023-08-29 20:24:08,960 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 20:24:08,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 529 events. 304/529 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2322 event pairs, 304 based on Foata normal form. 25/431 useless extension candidates. Maximal degree in co-relation 1050. Up to 516 conditions per place. [2023-08-29 20:24:08,968 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 19 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2023-08-29 20:24:08,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 88 flow [2023-08-29 20:24:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:24:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:24:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 212 transitions. [2023-08-29 20:24:08,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2023-08-29 20:24:08,986 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 212 transitions. [2023-08-29 20:24:08,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 212 transitions. [2023-08-29 20:24:08,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:08,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 212 transitions. [2023-08-29 20:24:08,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 106.0) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:24:09,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:09,002 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:09,004 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 60 flow. Second operand 2 states and 212 transitions. [2023-08-29 20:24:09,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 88 flow [2023-08-29 20:24:09,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 22 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:24:09,010 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 48 flow [2023-08-29 20:24:09,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-29 20:24:09,018 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -5 predicate places. [2023-08-29 20:24:09,018 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 48 flow [2023-08-29 20:24:09,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:24:09,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:09,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:24:09,028 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:24:09,228 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:24:09,228 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:24:09,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash 460495, now seen corresponding path program 1 times [2023-08-29 20:24:09,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:09,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268161348] [2023-08-29 20:24:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:09,230 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:24:09,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:09,232 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:24:09,235 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:24:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:09,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:24:09,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:09,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:24:09,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:09,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268161348] [2023-08-29 20:24:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268161348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:24:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912241448] [2023-08-29 20:24:09,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:09,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:24:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:24:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:24:09,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-08-29 20:24:09,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:24:09,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:09,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-08-29 20:24:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:09,490 INFO L130 PetriNetUnfolder]: 235/443 cut-off events. [2023-08-29 20:24:09,491 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:09,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 443 events. 235/443 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1976 event pairs, 76 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 857. Up to 334 conditions per place. [2023-08-29 20:24:09,496 INFO L137 encePairwiseOnDemand]: 205/208 looper letters, 25 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2023-08-29 20:24:09,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 136 flow [2023-08-29 20:24:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:24:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:24:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-29 20:24:09,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983974358974359 [2023-08-29 20:24:09,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-29 20:24:09,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-29 20:24:09,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:09,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-29 20:24:09,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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:24:09,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:24:09,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:24:09,508 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 48 flow. Second operand 3 states and 311 transitions. [2023-08-29 20:24:09,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 136 flow [2023-08-29 20:24:09,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:24:09,509 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 46 flow [2023-08-29 20:24:09,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-08-29 20:24:09,510 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -4 predicate places. [2023-08-29 20:24:09,510 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 46 flow [2023-08-29 20:24:09,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:24:09,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:09,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:09,520 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:24:09,720 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:24:09,720 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:24:09,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash -216816732, now seen corresponding path program 1 times [2023-08-29 20:24:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234422827] [2023-08-29 20:24:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:09,722 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:24:09,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:09,727 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:24:09,730 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:24:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:09,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:24:09,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:09,816 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:24:09,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:09,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234422827] [2023-08-29 20:24:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234422827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:24:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912307357] [2023-08-29 20:24:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:09,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:24:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:09,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:24:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:24:09,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 208 [2023-08-29 20:24:09,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:24:09,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:09,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 208 [2023-08-29 20:24:09,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:09,892 INFO L130 PetriNetUnfolder]: 53/127 cut-off events. [2023-08-29 20:24:09,892 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-29 20:24:09,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 127 events. 53/127 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 422 event pairs, 15 based on Foata normal form. 12/129 useless extension candidates. Maximal degree in co-relation 272. Up to 94 conditions per place. [2023-08-29 20:24:09,893 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 22 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2023-08-29 20:24:09,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 118 flow [2023-08-29 20:24:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:24:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:24:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-29 20:24:09,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-08-29 20:24:09,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-29 20:24:09,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-29 20:24:09,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:09,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-29 20:24:09,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:24:09,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:24:09,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states 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:24:09,899 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 46 flow. Second operand 3 states and 299 transitions. [2023-08-29 20:24:09,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 118 flow [2023-08-29 20:24:09,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:24:09,900 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 61 flow [2023-08-29 20:24:09,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-29 20:24:09,901 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -5 predicate places. [2023-08-29 20:24:09,902 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 61 flow [2023-08-29 20:24:09,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:24:09,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:09,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:09,913 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:24:10,111 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:24:10,112 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:24:10,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1073159523, now seen corresponding path program 1 times [2023-08-29 20:24:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96897076] [2023-08-29 20:24:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:10,113 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:24:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:10,115 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:24:10,117 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:24:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:10,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:24:10,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:10,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:10,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96897076] [2023-08-29 20:24:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96897076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:10,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:10,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:24:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723481651] [2023-08-29 20:24:10,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:10,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:24:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:24:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:24:10,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 208 [2023-08-29 20:24:10,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:24:10,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:10,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 208 [2023-08-29 20:24:10,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:10,366 INFO L130 PetriNetUnfolder]: 18/57 cut-off events. [2023-08-29 20:24:10,367 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-29 20:24:10,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 57 events. 18/57 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 10 based on Foata normal form. 7/61 useless extension candidates. Maximal degree in co-relation 141. Up to 29 conditions per place. [2023-08-29 20:24:10,367 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 20 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-29 20:24:10,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 127 flow [2023-08-29 20:24:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:24:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:24:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-08-29 20:24:10,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-29 20:24:10,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-08-29 20:24:10,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-08-29 20:24:10,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:10,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-08-29 20:24:10,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:10,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:24:10,373 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:24:10,373 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 61 flow. Second operand 4 states and 390 transitions. [2023-08-29 20:24:10,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 127 flow [2023-08-29 20:24:10,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:24:10,375 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 74 flow [2023-08-29 20:24:10,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-29 20:24:10,377 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-29 20:24:10,377 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 74 flow [2023-08-29 20:24:10,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:24:10,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:10,378 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:24:10,393 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:24:10,587 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:24:10,588 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:24:10,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 360094475, now seen corresponding path program 1 times [2023-08-29 20:24:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394737335] [2023-08-29 20:24:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:10,589 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:24:10,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:10,590 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:24:10,591 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:24:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:10,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 20:24:10,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:10,909 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:24:10,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:10,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394737335] [2023-08-29 20:24:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394737335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:24:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699627484] [2023-08-29 20:24:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:10,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:24:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:24:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:24:10,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 208 [2023-08-29 20:24:10,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:10,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:10,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 208 [2023-08-29 20:24:10,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:11,174 INFO L130 PetriNetUnfolder]: 19/78 cut-off events. [2023-08-29 20:24:11,174 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-08-29 20:24:11,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 78 events. 19/78 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 214 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2023-08-29 20:24:11,175 INFO L137 encePairwiseOnDemand]: 201/208 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-08-29 20:24:11,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 232 flow [2023-08-29 20:24:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:24:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:24:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 732 transitions. [2023-08-29 20:24:11,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43990384615384615 [2023-08-29 20:24:11,179 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 732 transitions. [2023-08-29 20:24:11,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 732 transitions. [2023-08-29 20:24:11,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:11,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 732 transitions. [2023-08-29 20:24:11,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:24:11,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states 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:24:11,185 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states 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:24:11,185 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 74 flow. Second operand 8 states and 732 transitions. [2023-08-29 20:24:11,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 232 flow [2023-08-29 20:24:11,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 212 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:24:11,189 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 96 flow [2023-08-29 20:24:11,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=96, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2023-08-29 20:24:11,191 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-29 20:24:11,191 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 96 flow [2023-08-29 20:24:11,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:11,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:11,195 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:24:11,207 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 (6)] Ended with exit code 0 [2023-08-29 20:24:11,405 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:24:11,405 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:24:11,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1519102901, now seen corresponding path program 2 times [2023-08-29 20:24:11,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:11,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15241923] [2023-08-29 20:24:11,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:24:11,406 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:24:11,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:11,407 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:24:11,408 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:24:11,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:24:11,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:24:11,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:24:11,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:11,556 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:24:11,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:11,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:11,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15241923] [2023-08-29 20:24:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15241923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:24:11,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846149166] [2023-08-29 20:24:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:11,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:24:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:11,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:24:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:24:11,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 208 [2023-08-29 20:24:11,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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:24:11,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:11,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 208 [2023-08-29 20:24:11,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:11,718 INFO L130 PetriNetUnfolder]: 31/115 cut-off events. [2023-08-29 20:24:11,718 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2023-08-29 20:24:11,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 115 events. 31/115 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 388 event pairs, 13 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 338. Up to 48 conditions per place. [2023-08-29 20:24:11,719 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-29 20:24:11,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 257 flow [2023-08-29 20:24:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:24:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:24:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-08-29 20:24:11,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576923076923077 [2023-08-29 20:24:11,721 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-08-29 20:24:11,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-08-29 20:24:11,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:11,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-08-29 20:24:11,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:11,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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:24:11,724 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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:24:11,725 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 96 flow. Second operand 5 states and 476 transitions. [2023-08-29 20:24:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 257 flow [2023-08-29 20:24:11,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:24:11,727 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 125 flow [2023-08-29 20:24:11,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=125, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-29 20:24:11,727 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-08-29 20:24:11,727 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 125 flow [2023-08-29 20:24:11,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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:24:11,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:11,728 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:24:11,741 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:24:11,937 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:24:11,938 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:24:11,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1702620976, now seen corresponding path program 1 times [2023-08-29 20:24:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720875622] [2023-08-29 20:24:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:11,939 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:24:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:11,940 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:24:11,941 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:24:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:24:12,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:12,284 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:24:12,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:12,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720875622] [2023-08-29 20:24:12,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720875622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:12,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:12,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:24:12,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265171460] [2023-08-29 20:24:12,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:12,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:24:12,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:12,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:24:12,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:24:12,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 208 [2023-08-29 20:24:12,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states 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:24:12,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:12,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 208 [2023-08-29 20:24:12,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:12,536 INFO L130 PetriNetUnfolder]: 26/99 cut-off events. [2023-08-29 20:24:12,536 INFO L131 PetriNetUnfolder]: For 76/78 co-relation queries the response was YES. [2023-08-29 20:24:12,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 99 events. 26/99 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 327 event pairs, 14 based on Foata normal form. 5/103 useless extension candidates. Maximal degree in co-relation 306. Up to 87 conditions per place. [2023-08-29 20:24:12,537 INFO L137 encePairwiseOnDemand]: 205/208 looper letters, 16 selfloop transitions, 2 changer transitions 8/29 dead transitions. [2023-08-29 20:24:12,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 185 flow [2023-08-29 20:24:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:24:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:24:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-29 20:24:12,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170673076923077 [2023-08-29 20:24:12,539 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-29 20:24:12,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-29 20:24:12,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:12,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-29 20:24:12,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:24:12,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:24:12,542 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:24:12,542 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 125 flow. Second operand 4 states and 347 transitions. [2023-08-29 20:24:12,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 185 flow [2023-08-29 20:24:12,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 29 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:24:12,544 INFO L231 Difference]: Finished difference. Result has 44 places, 20 transitions, 84 flow [2023-08-29 20:24:12,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=84, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2023-08-29 20:24:12,545 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-08-29 20:24:12,545 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 84 flow [2023-08-29 20:24:12,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states 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:24:12,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:12,546 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:24:12,558 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:24:12,755 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:24:12,756 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:24:12,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -645226867, now seen corresponding path program 3 times [2023-08-29 20:24:12,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:12,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420010406] [2023-08-29 20:24:12,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:24:12,757 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:24:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:12,759 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:24:12,762 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:24:12,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:24:12,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:24:12,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:24:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:24:12,948 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:24:12,948 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:24:12,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:24:12,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:24:12,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:24:12,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:24:12,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:24:12,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:24:12,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:24:12,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:24:12,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:24:12,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:24:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-29 20:24:13,152 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:24:13,153 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-29 20:24:13,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:24:13,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:24:13,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:24:13 BasicIcfg [2023-08-29 20:24:13,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:24:13,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:24:13,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:24:13,204 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:24:13,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:24:03" (3/4) ... [2023-08-29 20:24:13,207 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:24:13,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:24:13,208 INFO L158 Benchmark]: Toolchain (without parser) took 11418.27ms. Allocated memory was 67.1MB in the beginning and 132.1MB in the end (delta: 65.0MB). Free memory was 47.5MB in the beginning and 66.7MB in the end (delta: -19.2MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2023-08-29 20:24:13,208 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:24:13,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.87ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 47.3MB in the beginning and 61.8MB in the end (delta: -14.5MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2023-08-29 20:24:13,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.31ms. Allocated memory is still 90.2MB. Free memory was 61.8MB in the beginning and 59.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:13,209 INFO L158 Benchmark]: Boogie Preprocessor took 61.44ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:13,209 INFO L158 Benchmark]: RCFGBuilder took 761.45ms. Allocated memory is still 90.2MB. Free memory was 57.4MB in the beginning and 42.5MB in the end (delta: 14.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-08-29 20:24:13,210 INFO L158 Benchmark]: TraceAbstraction took 10008.31ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 41.5MB in the beginning and 66.7MB in the end (delta: -25.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-08-29 20:24:13,210 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 132.1MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:24:13,212 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.16ms. Allocated memory is still 67.1MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.87ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 47.3MB in the beginning and 61.8MB in the end (delta: -14.5MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.31ms. Allocated memory is still 90.2MB. Free memory was 61.8MB in the beginning and 59.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.44ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 761.45ms. Allocated memory is still 90.2MB. Free memory was 57.4MB in the beginning and 42.5MB in the end (delta: 14.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10008.31ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 41.5MB in the beginning and 66.7MB in the end (delta: -25.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 132.1MB. 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, 108 PlacesBefore, 33 PlacesAfterwards, 103 TransitionsBefore, 27 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 3979 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1929, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 812, independent: 788, independent conditional: 0, independent unconditional: 788, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1929, independent: 993, independent conditional: 0, independent unconditional: 993, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 812, unknown conditional: 0, unknown unconditional: 812] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=0, t833={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; [L830] FCALL, FORK 0 pthread_create(&t834, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=1, t833={3:0}, t834={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={3:0}, t834={7:0}, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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, 127 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.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 529 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 38 mSDtfsCounter, 529 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 15 QuantifiedInterpolants, 618 SizeOfPredicates, 5 NumberOfNonLiveVariables, 690 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:24:13,231 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