./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:54:32,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:54:32,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:54:32,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:54:32,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:54:32,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:54:32,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:54:32,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:54:32,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:54:32,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:54:32,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:54:32,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:54:32,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:54:32,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:54:32,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:54:32,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:54:32,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:54:32,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:54:32,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:54:32,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:54:32,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:54:32,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:54:32,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:54:32,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:54:32,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:54:32,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:54:32,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:54:32,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:54:32,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:54:32,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:54:32,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:54:32,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:54:32,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:54:32,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:54:32,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:54:32,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:54:32,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:54:32,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:54:32,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:54:32,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:54:32,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:54:32,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:54:32,527 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:54:32,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:54:32,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:54:32,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:54:32,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:54:32,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:54:32,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:54:32,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:54:32,530 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:54:32,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:54:32,531 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:54:32,531 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:54:32,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:54:32,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:54:32,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:54:32,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:54:32,532 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:54:32,532 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:54:32,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:54:32,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:54:32,533 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:54:32,533 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:54:32,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:54:32,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:54:32,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:54:32,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:54:32,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:54:32,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:54:32,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:54:32,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:54:32,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:54:32,535 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:54:32,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:54:32,535 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:54:32,535 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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:54:32,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:54:32,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:54:32,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:54:32,886 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:54:32,886 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:54:32,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-08-30 02:54:33,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:54:34,234 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:54:34,235 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-08-30 02:54:34,252 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9a308fa/23d30cc7241546dcafad7d167575fd0c/FLAG18a7d07c9 [2023-08-30 02:54:34,273 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9a308fa/23d30cc7241546dcafad7d167575fd0c [2023-08-30 02:54:34,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:54:34,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:54:34,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:54:34,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:54:34,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:54:34,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13055346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34, skipping insertion in model container [2023-08-30 02:54:34,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:54:34,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:54:34,471 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/mix039.opt.i[944,957] [2023-08-30 02:54:34,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:54:34,698 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:54:34,709 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/mix039.opt.i[944,957] [2023-08-30 02:54:34,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:54:34,822 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:54:34,822 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:54:34,843 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:54:34,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34 WrapperNode [2023-08-30 02:54:34,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:54:34,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:54:34,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:54:34,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:54:34,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,911 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-30 02:54:34,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:54:34,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:54:34,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:54:34,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:54:34,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,965 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:54:34,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:54:34,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:54:34,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:54:34,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (1/1) ... [2023-08-30 02:54:34,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:54:34,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:54:35,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:54:35,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:54:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:54:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:54:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:54:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:54:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:54:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:54:35,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:54:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:54:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:54:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:54:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:54:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:54:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:54:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:54:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:54:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:54:35,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:54:35,044 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:54:35,171 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:54:35,173 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:54:35,563 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:54:35,651 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:54:35,651 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:54:35,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:35 BoogieIcfgContainer [2023-08-30 02:54:35,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:54:35,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:54:35,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:54:35,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:54:35,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:54:34" (1/3) ... [2023-08-30 02:54:35,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acbe8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:54:35, skipping insertion in model container [2023-08-30 02:54:35,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:54:34" (2/3) ... [2023-08-30 02:54:35,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acbe8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:54:35, skipping insertion in model container [2023-08-30 02:54:35,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:35" (3/3) ... [2023-08-30 02:54:35,661 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-08-30 02:54:35,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:54:35,675 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:54:35,675 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:54:35,746 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:54:35,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:54:35,842 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:54:35,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:35,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:54:35,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-30 02:54:35,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-30 02:54:35,860 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:54:35,879 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:54:35,882 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-30 02:54:35,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-30 02:54:35,933 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-30 02:54:35,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:54:35,936 INFO L119 LiptonReduction]: Number of co-enabled transitions 3128 [2023-08-30 02:54:40,306 INFO L134 LiptonReduction]: Checked pairs total: 7163 [2023-08-30 02:54:40,307 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-30 02:54:40,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:54:40,322 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;@63765885, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:54:40,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:54:40,324 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:54:40,324 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:40,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:40,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:54:40,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:40,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash 579, now seen corresponding path program 1 times [2023-08-30 02:54:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046503003] [2023-08-30 02:54:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046503003] [2023-08-30 02:54:40,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046503003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:54:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406912694] [2023-08-30 02:54:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:40,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:54:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:54:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:54:40,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 279 [2023-08-30 02:54:40,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:40,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:40,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 279 [2023-08-30 02:54:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:41,112 INFO L130 PetriNetUnfolder]: 3632/5102 cut-off events. [2023-08-30 02:54:41,112 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-30 02:54:41,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10195 conditions, 5102 events. 3632/5102 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 25995 event pairs, 3632 based on Foata normal form. 0/4378 useless extension candidates. Maximal degree in co-relation 10183. Up to 4990 conditions per place. [2023-08-30 02:54:41,151 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:54:41,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-30 02:54:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:54:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:54:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2023-08-30 02:54:41,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2023-08-30 02:54:41,189 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 294 transitions. [2023-08-30 02:54:41,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 294 transitions. [2023-08-30 02:54:41,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:41,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 294 transitions. [2023-08-30 02:54:41,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:41,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:41,200 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:41,202 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 294 transitions. [2023-08-30 02:54:41,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-30 02:54:41,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:54:41,210 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:54:41,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:54:41,215 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:54:41,215 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:54:41,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:41,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:41,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:41,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:54:41,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:41,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1376313695, now seen corresponding path program 1 times [2023-08-30 02:54:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:41,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339733860] [2023-08-30 02:54:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339733860] [2023-08-30 02:54:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339733860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:54:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303789611] [2023-08-30 02:54:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:41,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:41,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:41,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 279 [2023-08-30 02:54:41,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:41,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:41,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 279 [2023-08-30 02:54:41,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:42,050 INFO L130 PetriNetUnfolder]: 2891/4505 cut-off events. [2023-08-30 02:54:42,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:54:42,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 4505 events. 2891/4505 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26505 event pairs, 668 based on Foata normal form. 0/4213 useless extension candidates. Maximal degree in co-relation 8599. Up to 2980 conditions per place. [2023-08-30 02:54:42,071 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-30 02:54:42,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 164 flow [2023-08-30 02:54:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-30 02:54:42,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077658303464755 [2023-08-30 02:54:42,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-30 02:54:42,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-30 02:54:42,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:42,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-30 02:54:42,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:42,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:42,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:42,085 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 425 transitions. [2023-08-30 02:54:42,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 164 flow [2023-08-30 02:54:42,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:54:42,086 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:54:42,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:54:42,087 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:54:42,087 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:54:42,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:42,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:42,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:42,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:54:42,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:42,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:42,092 INFO L85 PathProgramCache]: Analyzing trace with hash -212380118, now seen corresponding path program 1 times [2023-08-30 02:54:42,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:42,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645685138] [2023-08-30 02:54:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:42,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645685138] [2023-08-30 02:54:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645685138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:54:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902287719] [2023-08-30 02:54:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:42,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:54:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:54:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:54:42,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 279 [2023-08-30 02:54:42,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:42,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:42,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 279 [2023-08-30 02:54:42,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:43,739 INFO L130 PetriNetUnfolder]: 10879/14872 cut-off events. [2023-08-30 02:54:43,740 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2023-08-30 02:54:43,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30583 conditions, 14872 events. 10879/14872 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 76169 event pairs, 3827 based on Foata normal form. 0/14504 useless extension candidates. Maximal degree in co-relation 30579. Up to 9797 conditions per place. [2023-08-30 02:54:43,824 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-08-30 02:54:43,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 224 flow [2023-08-30 02:54:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:54:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:54:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 02:54:43,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922341696535245 [2023-08-30 02:54:43,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 02:54:43,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 02:54:43,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:43,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 02:54:43,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:43,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:43,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:43,888 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 412 transitions. [2023-08-30 02:54:43,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 224 flow [2023-08-30 02:54:43,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:43,895 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 124 flow [2023-08-30 02:54:43,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-30 02:54:43,896 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-30 02:54:43,896 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 124 flow [2023-08-30 02:54:43,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:43,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:43,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:43,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:54:43,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:43,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2006148987, now seen corresponding path program 1 times [2023-08-30 02:54:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987144820] [2023-08-30 02:54:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:44,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987144820] [2023-08-30 02:54:44,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987144820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:44,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:54:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096651600] [2023-08-30 02:54:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:44,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:44,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 279 [2023-08-30 02:54:44,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:44,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:44,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 279 [2023-08-30 02:54:44,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:45,378 INFO L130 PetriNetUnfolder]: 10415/14240 cut-off events. [2023-08-30 02:54:45,378 INFO L131 PetriNetUnfolder]: For 6016/6016 co-relation queries the response was YES. [2023-08-30 02:54:45,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36889 conditions, 14240 events. 10415/14240 cut-off events. For 6016/6016 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 70494 event pairs, 2683 based on Foata normal form. 112/14352 useless extension candidates. Maximal degree in co-relation 36884. Up to 6789 conditions per place. [2023-08-30 02:54:45,462 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 53 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2023-08-30 02:54:45,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 334 flow [2023-08-30 02:54:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-30 02:54:45,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48118279569892475 [2023-08-30 02:54:45,464 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-30 02:54:45,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-30 02:54:45,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:45,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-30 02:54:45,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:45,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:45,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:45,469 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 124 flow. Second operand 4 states and 537 transitions. [2023-08-30 02:54:45,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 334 flow [2023-08-30 02:54:45,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:54:45,501 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 176 flow [2023-08-30 02:54:45,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-30 02:54:45,501 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-30 02:54:45,502 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 176 flow [2023-08-30 02:54:45,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:45,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:45,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:45,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:54:45,503 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:45,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2006151833, now seen corresponding path program 1 times [2023-08-30 02:54:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:45,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459266126] [2023-08-30 02:54:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459266126] [2023-08-30 02:54:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459266126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:46,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:54:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301708232] [2023-08-30 02:54:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:46,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:54:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:54:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:54:46,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 279 [2023-08-30 02:54:46,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:46,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:46,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 279 [2023-08-30 02:54:46,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:47,439 INFO L130 PetriNetUnfolder]: 7898/11501 cut-off events. [2023-08-30 02:54:47,440 INFO L131 PetriNetUnfolder]: For 8329/8658 co-relation queries the response was YES. [2023-08-30 02:54:47,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30416 conditions, 11501 events. 7898/11501 cut-off events. For 8329/8658 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 67017 event pairs, 1032 based on Foata normal form. 575/11947 useless extension candidates. Maximal degree in co-relation 30409. Up to 6956 conditions per place. [2023-08-30 02:54:47,526 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 48 selfloop transitions, 6 changer transitions 18/80 dead transitions. [2023-08-30 02:54:47,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 456 flow [2023-08-30 02:54:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:54:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:54:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-30 02:54:47,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4352278545826933 [2023-08-30 02:54:47,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-30 02:54:47,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-30 02:54:47,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:47,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-30 02:54:47,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:47,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:47,537 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:47,537 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 176 flow. Second operand 7 states and 850 transitions. [2023-08-30 02:54:47,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 456 flow [2023-08-30 02:54:47,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:54:47,587 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 186 flow [2023-08-30 02:54:47,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-30 02:54:47,588 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-30 02:54:47,588 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 186 flow [2023-08-30 02:54:47,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:47,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:47,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:47,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:54:47,589 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:47,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2059478564, now seen corresponding path program 1 times [2023-08-30 02:54:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92884641] [2023-08-30 02:54:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92884641] [2023-08-30 02:54:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92884641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:54:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539787368] [2023-08-30 02:54:47,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:47,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:47,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 279 [2023-08-30 02:54:47,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:47,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:47,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 279 [2023-08-30 02:54:47,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:48,528 INFO L130 PetriNetUnfolder]: 8699/11964 cut-off events. [2023-08-30 02:54:48,528 INFO L131 PetriNetUnfolder]: For 9402/9402 co-relation queries the response was YES. [2023-08-30 02:54:48,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34283 conditions, 11964 events. 8699/11964 cut-off events. For 9402/9402 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 59435 event pairs, 1419 based on Foata normal form. 32/11996 useless extension candidates. Maximal degree in co-relation 34273. Up to 7405 conditions per place. [2023-08-30 02:54:48,599 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 62 selfloop transitions, 18 changer transitions 0/80 dead transitions. [2023-08-30 02:54:48,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 518 flow [2023-08-30 02:54:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-30 02:54:48,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-08-30 02:54:48,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-30 02:54:48,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-30 02:54:48,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:48,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-30 02:54:48,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:48,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:48,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:48,605 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 186 flow. Second operand 4 states and 549 transitions. [2023-08-30 02:54:48,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 518 flow [2023-08-30 02:54:48,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 488 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-30 02:54:48,667 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 334 flow [2023-08-30 02:54:48,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-30 02:54:48,667 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:54:48,668 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 334 flow [2023-08-30 02:54:48,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:48,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:48,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:48,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:54:48,669 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:48,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -580626613, now seen corresponding path program 1 times [2023-08-30 02:54:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676886336] [2023-08-30 02:54:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676886336] [2023-08-30 02:54:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676886336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:48,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:48,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:48,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548972267] [2023-08-30 02:54:48,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:48,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:48,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-30 02:54:48,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:48,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:48,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-30 02:54:48,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:49,473 INFO L130 PetriNetUnfolder]: 5280/7822 cut-off events. [2023-08-30 02:54:49,474 INFO L131 PetriNetUnfolder]: For 12829/13493 co-relation queries the response was YES. [2023-08-30 02:54:49,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22859 conditions, 7822 events. 5280/7822 cut-off events. For 12829/13493 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 45807 event pairs, 1101 based on Foata normal form. 639/8090 useless extension candidates. Maximal degree in co-relation 22848. Up to 5711 conditions per place. [2023-08-30 02:54:49,516 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 75 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2023-08-30 02:54:49,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 102 transitions, 769 flow [2023-08-30 02:54:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:54:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:54:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-08-30 02:54:49,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-08-30 02:54:49,519 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-08-30 02:54:49,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-08-30 02:54:49,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:49,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-08-30 02:54:49,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:49,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:49,523 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:49,523 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 334 flow. Second operand 5 states and 682 transitions. [2023-08-30 02:54:49,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 102 transitions, 769 flow [2023-08-30 02:54:49,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 102 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:54:49,546 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 409 flow [2023-08-30 02:54:49,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2023-08-30 02:54:49,547 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-08-30 02:54:49,547 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 409 flow [2023-08-30 02:54:49,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:49,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:49,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:49,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:54:49,548 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:49,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1539256050, now seen corresponding path program 1 times [2023-08-30 02:54:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:49,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533352477] [2023-08-30 02:54:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:49,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:49,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533352477] [2023-08-30 02:54:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533352477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:54:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507691824] [2023-08-30 02:54:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:49,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:54:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:54:49,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:54:49,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-30 02:54:49,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:49,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:49,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-30 02:54:49,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:50,372 INFO L130 PetriNetUnfolder]: 3489/5437 cut-off events. [2023-08-30 02:54:50,373 INFO L131 PetriNetUnfolder]: For 10934/11889 co-relation queries the response was YES. [2023-08-30 02:54:50,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19566 conditions, 5437 events. 3489/5437 cut-off events. For 10934/11889 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 32634 event pairs, 368 based on Foata normal form. 604/5822 useless extension candidates. Maximal degree in co-relation 19551. Up to 1949 conditions per place. [2023-08-30 02:54:50,407 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 98 selfloop transitions, 19 changer transitions 3/135 dead transitions. [2023-08-30 02:54:50,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 135 transitions, 1097 flow [2023-08-30 02:54:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:54:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:54:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2023-08-30 02:54:50,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48899129544290837 [2023-08-30 02:54:50,416 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2023-08-30 02:54:50,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2023-08-30 02:54:50,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:50,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2023-08-30 02:54:50,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:50,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:50,425 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:50,425 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 409 flow. Second operand 7 states and 955 transitions. [2023-08-30 02:54:50,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 135 transitions, 1097 flow [2023-08-30 02:54:50,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 135 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:54:50,450 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 518 flow [2023-08-30 02:54:50,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2023-08-30 02:54:50,453 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-30 02:54:50,453 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 518 flow [2023-08-30 02:54:50,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:50,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:50,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:50,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:54:50,454 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:50,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1805705638, now seen corresponding path program 1 times [2023-08-30 02:54:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056346539] [2023-08-30 02:54:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:50,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:50,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056346539] [2023-08-30 02:54:50,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056346539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:50,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:50,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:54:50,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129741500] [2023-08-30 02:54:50,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:50,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:54:50,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:50,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:54:50,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:54:50,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-30 02:54:50,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:50,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:50,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-30 02:54:50,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:51,411 INFO L130 PetriNetUnfolder]: 2850/4470 cut-off events. [2023-08-30 02:54:51,411 INFO L131 PetriNetUnfolder]: For 13771/15816 co-relation queries the response was YES. [2023-08-30 02:54:51,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18745 conditions, 4470 events. 2850/4470 cut-off events. For 13771/15816 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 26610 event pairs, 218 based on Foata normal form. 543/4837 useless extension candidates. Maximal degree in co-relation 18727. Up to 1677 conditions per place. [2023-08-30 02:54:51,445 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 104 selfloop transitions, 28 changer transitions 13/160 dead transitions. [2023-08-30 02:54:51,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 160 transitions, 1395 flow [2023-08-30 02:54:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:54:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:54:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1226 transitions. [2023-08-30 02:54:51,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48825169255276785 [2023-08-30 02:54:51,450 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1226 transitions. [2023-08-30 02:54:51,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1226 transitions. [2023-08-30 02:54:51,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:51,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1226 transitions. [2023-08-30 02:54:51,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:51,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:51,458 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:51,458 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 518 flow. Second operand 9 states and 1226 transitions. [2023-08-30 02:54:51,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 160 transitions, 1395 flow [2023-08-30 02:54:51,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 160 transitions, 1301 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-30 02:54:51,616 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 610 flow [2023-08-30 02:54:51,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=610, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2023-08-30 02:54:51,617 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-30 02:54:51,617 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 610 flow [2023-08-30 02:54:51,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:51,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:51,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:51,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:54:51,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:51,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1924746352, now seen corresponding path program 1 times [2023-08-30 02:54:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509345265] [2023-08-30 02:54:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:51,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509345265] [2023-08-30 02:54:51,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509345265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:51,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:51,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:54:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252650541] [2023-08-30 02:54:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:51,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:54:51,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:51,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:54:51,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:54:51,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-30 02:54:51,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 610 flow. Second operand has 7 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:51,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:51,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-30 02:54:51,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:52,591 INFO L130 PetriNetUnfolder]: 2757/4300 cut-off events. [2023-08-30 02:54:52,591 INFO L131 PetriNetUnfolder]: For 12795/13769 co-relation queries the response was YES. [2023-08-30 02:54:52,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18197 conditions, 4300 events. 2757/4300 cut-off events. For 12795/13769 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 25641 event pairs, 206 based on Foata normal form. 345/4473 useless extension candidates. Maximal degree in co-relation 18176. Up to 1120 conditions per place. [2023-08-30 02:54:52,620 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 100 selfloop transitions, 33 changer transitions 13/160 dead transitions. [2023-08-30 02:54:52,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 160 transitions, 1405 flow [2023-08-30 02:54:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:54:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:54:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1475 transitions. [2023-08-30 02:54:52,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48061257738677093 [2023-08-30 02:54:52,625 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1475 transitions. [2023-08-30 02:54:52,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1475 transitions. [2023-08-30 02:54:52,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:52,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1475 transitions. [2023-08-30 02:54:52,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.0909090909091) internal successors, (1475), 11 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:52,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:52,634 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:52,634 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 610 flow. Second operand 11 states and 1475 transitions. [2023-08-30 02:54:52,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 160 transitions, 1405 flow [2023-08-30 02:54:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 160 transitions, 1291 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-08-30 02:54:52,891 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 587 flow [2023-08-30 02:54:52,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=587, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-30 02:54:52,892 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2023-08-30 02:54:52,892 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 587 flow [2023-08-30 02:54:52,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:52,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:52,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:52,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:54:52,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:52,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1220462151, now seen corresponding path program 1 times [2023-08-30 02:54:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:52,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281267827] [2023-08-30 02:54:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:53,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:53,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281267827] [2023-08-30 02:54:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281267827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:54:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46081738] [2023-08-30 02:54:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:54:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:54:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:54:53,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 279 [2023-08-30 02:54:53,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:53,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:53,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 279 [2023-08-30 02:54:53,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:54,306 INFO L130 PetriNetUnfolder]: 6291/9516 cut-off events. [2023-08-30 02:54:54,307 INFO L131 PetriNetUnfolder]: For 34538/34538 co-relation queries the response was YES. [2023-08-30 02:54:54,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43264 conditions, 9516 events. 6291/9516 cut-off events. For 34538/34538 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 56732 event pairs, 721 based on Foata normal form. 1/9517 useless extension candidates. Maximal degree in co-relation 43241. Up to 3150 conditions per place. [2023-08-30 02:54:54,345 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 163 selfloop transitions, 39 changer transitions 89/291 dead transitions. [2023-08-30 02:54:54,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 291 transitions, 2929 flow [2023-08-30 02:54:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:54:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:54:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1165 transitions. [2023-08-30 02:54:54,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639585822381521 [2023-08-30 02:54:54,350 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1165 transitions. [2023-08-30 02:54:54,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1165 transitions. [2023-08-30 02:54:54,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:54,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1165 transitions. [2023-08-30 02:54:54,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.44444444444446) internal successors, (1165), 9 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:54,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:54,358 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:54,358 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 587 flow. Second operand 9 states and 1165 transitions. [2023-08-30 02:54:54,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 291 transitions, 2929 flow [2023-08-30 02:54:54,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 291 transitions, 2454 flow, removed 84 selfloop flow, removed 10 redundant places. [2023-08-30 02:54:54,744 INFO L231 Difference]: Finished difference. Result has 82 places, 89 transitions, 787 flow [2023-08-30 02:54:54,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2023-08-30 02:54:54,745 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-08-30 02:54:54,745 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 787 flow [2023-08-30 02:54:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:54,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:54,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:54,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:54:54,746 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:54,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -317269049, now seen corresponding path program 2 times [2023-08-30 02:54:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310645553] [2023-08-30 02:54:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:54,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310645553] [2023-08-30 02:54:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310645553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:54,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632521351] [2023-08-30 02:54:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:54,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:54,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:54,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:54,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 279 [2023-08-30 02:54:54,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 787 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:54,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:54,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 279 [2023-08-30 02:54:54,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:55,324 INFO L130 PetriNetUnfolder]: 2295/3734 cut-off events. [2023-08-30 02:54:55,324 INFO L131 PetriNetUnfolder]: For 12561/12810 co-relation queries the response was YES. [2023-08-30 02:54:55,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16214 conditions, 3734 events. 2295/3734 cut-off events. For 12561/12810 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 22098 event pairs, 346 based on Foata normal form. 118/3773 useless extension candidates. Maximal degree in co-relation 16189. Up to 1989 conditions per place. [2023-08-30 02:54:55,347 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 132 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2023-08-30 02:54:55,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 160 transitions, 1589 flow [2023-08-30 02:54:55,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-30 02:54:55,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982078853046595 [2023-08-30 02:54:55,350 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-30 02:54:55,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-30 02:54:55,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:55,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-30 02:54:55,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:55,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:55,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:55,353 INFO L175 Difference]: Start difference. First operand has 82 places, 89 transitions, 787 flow. Second operand 4 states and 556 transitions. [2023-08-30 02:54:55,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 160 transitions, 1589 flow [2023-08-30 02:54:55,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 160 transitions, 1531 flow, removed 29 selfloop flow, removed 6 redundant places. [2023-08-30 02:54:55,435 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 791 flow [2023-08-30 02:54:55,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=791, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2023-08-30 02:54:55,436 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2023-08-30 02:54:55,436 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 791 flow [2023-08-30 02:54:55,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:55,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:55,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:55,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:54:55,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:55,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1353311435, now seen corresponding path program 3 times [2023-08-30 02:54:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:55,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58999039] [2023-08-30 02:54:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:55,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:54:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:54:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:54:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58999039] [2023-08-30 02:54:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58999039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:54:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:54:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:54:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733815828] [2023-08-30 02:54:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:54:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:54:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:54:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:54:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:54:55,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 279 [2023-08-30 02:54:55,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 791 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:55,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:54:55,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 279 [2023-08-30 02:54:55,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:54:56,213 INFO L130 PetriNetUnfolder]: 3513/5503 cut-off events. [2023-08-30 02:54:56,213 INFO L131 PetriNetUnfolder]: For 19257/19257 co-relation queries the response was YES. [2023-08-30 02:54:56,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24718 conditions, 5503 events. 3513/5503 cut-off events. For 19257/19257 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 30683 event pairs, 795 based on Foata normal form. 1/5504 useless extension candidates. Maximal degree in co-relation 24696. Up to 2952 conditions per place. [2023-08-30 02:54:56,247 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 107 selfloop transitions, 28 changer transitions 0/135 dead transitions. [2023-08-30 02:54:56,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 135 transitions, 1299 flow [2023-08-30 02:54:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:54:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:54:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-30 02:54:56,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48476702508960573 [2023-08-30 02:54:56,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-30 02:54:56,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-30 02:54:56,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:54:56,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-30 02:54:56,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:56,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:56,253 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:56,253 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 791 flow. Second operand 4 states and 541 transitions. [2023-08-30 02:54:56,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 135 transitions, 1299 flow [2023-08-30 02:54:56,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 135 transitions, 1296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:54:56,387 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 922 flow [2023-08-30 02:54:56,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=922, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2023-08-30 02:54:56,388 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2023-08-30 02:54:56,388 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 922 flow [2023-08-30 02:54:56,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:54:56,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:54:56,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:56,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:54:56,389 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:54:56,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:54:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash -833421339, now seen corresponding path program 4 times [2023-08-30 02:54:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:54:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498203997] [2023-08-30 02:54:56,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:54:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:54:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:54:56,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:54:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:54:56,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:54:56,477 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:54:56,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:54:56,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:54:56,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:54:56,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:54:56,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:54:56,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:54:56,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:54:56,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:54:56,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:54:56,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:54:56,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:54:56,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:54:56,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:54:56,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:54:56,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:54:56,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:54:56,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:54:56,482 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:54:56,486 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:54:56,486 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:54:56,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:54:56 BasicIcfg [2023-08-30 02:54:56,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:54:56,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:54:56,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:54:56,559 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:54:56,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:54:35" (3/4) ... [2023-08-30 02:54:56,562 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:54:56,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:54:56,562 INFO L158 Benchmark]: Toolchain (without parser) took 22285.55ms. Allocated memory was 79.7MB in the beginning and 2.3GB in the end (delta: 2.3GB). Free memory was 56.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2023-08-30 02:54:56,562 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:56,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.66ms. Allocated memory is still 79.7MB. Free memory was 55.8MB in the beginning and 52.5MB in the end (delta: 3.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-08-30 02:54:56,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.00ms. Allocated memory is still 79.7MB. Free memory was 52.5MB in the beginning and 49.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:56,563 INFO L158 Benchmark]: Boogie Preprocessor took 64.08ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:54:56,563 INFO L158 Benchmark]: RCFGBuilder took 676.31ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 38.8MB in the end (delta: 9.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2023-08-30 02:54:56,563 INFO L158 Benchmark]: TraceAbstraction took 20903.88ms. Allocated memory was 79.7MB in the beginning and 2.3GB in the end (delta: 2.3GB). Free memory was 37.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-30 02:54:56,564 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 2.3GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:54:56,565 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.66ms. Allocated memory is still 79.7MB. Free memory was 55.8MB in the beginning and 52.5MB in the end (delta: 3.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.00ms. Allocated memory is still 79.7MB. Free memory was 52.5MB in the beginning and 49.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.08ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 676.31ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 38.8MB in the end (delta: 9.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20903.88ms. Allocated memory was 79.7MB in the beginning and 2.3GB in the end (delta: 2.3GB). Free memory was 37.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 2.3GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 149 PlacesBefore, 50 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 3128 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 7163 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3691, independent: 3523, independent conditional: 0, independent unconditional: 3523, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1730, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3691, independent: 1833, independent conditional: 0, independent unconditional: 1833, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 1730, unknown conditional: 0, unknown unconditional: 1730] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1029, ((void *)0), P0, ((void *)0))=-3, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1030, ((void *)0), P1, ((void *)0))=-2, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1031, ((void *)0), P2, ((void *)0))=-1, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1032, ((void *)0), P3, ((void *)0))=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2159 IncrementalHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 55 mSDtfsCounter, 2159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=13, InterpolantAutomatonStates: 72, 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.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:54:56,592 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/mix039.opt.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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:54:58,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:54:58,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:54:58,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:54:58,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:54:58,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:54:58,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:54:58,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:54:58,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:54:58,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:54:58,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:54:58,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:54:58,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:54:58,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:54:58,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:54:58,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:54:58,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:54:58,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:54:58,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:54:58,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:54:58,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:54:58,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:54:58,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:54:58,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:54:58,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:54:58,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:54:58,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:54:58,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:54:58,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:54:58,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:54:58,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:54:58,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:54:58,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:54:58,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:54:58,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:54:58,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:54:58,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:54:58,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:54:58,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:54:58,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:54:58,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:54:58,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:54:58,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:54:58,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:54:58,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:54:58,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:54:58,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:54:58,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:54:58,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:54:58,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:54:58,793 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:54:58,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:54:58,794 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:54:58,794 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:54:58,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:54:58,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:54:58,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:54:58,796 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:54:58,797 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:54:58,797 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:54:58,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:54:58,797 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:54:58,797 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:54:58,797 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:54:58,798 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:54:58,798 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:54:58,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:54:58,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:54:58,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:54:58,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:54:58,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:54:58,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:54:58,799 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:54:58,800 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:54:58,800 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:54:58,800 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:54:58,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:54:58,800 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:54:58,801 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:54:58,801 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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:54:59,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:54:59,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:54:59,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:54:59,095 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:54:59,095 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:54:59,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-08-30 02:55:00,172 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:55:00,413 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:55:00,414 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-08-30 02:55:00,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c5f109c/bd930785a9a747458ea425fefbfa083a/FLAG0a4be3369 [2023-08-30 02:55:00,451 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c5f109c/bd930785a9a747458ea425fefbfa083a [2023-08-30 02:55:00,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:55:00,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:55:00,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:55:00,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:55:00,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:55:00,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:55:00" (1/1) ... [2023-08-30 02:55:00,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e03bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:00, skipping insertion in model container [2023-08-30 02:55:00,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:55:00" (1/1) ... [2023-08-30 02:55:00,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:55:00,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:55:00,701 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/mix039.opt.i[944,957] [2023-08-30 02:55:00,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:55:00,925 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:55:00,935 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i[944,957] [2023-08-30 02:55:00,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:55:01,007 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:55:01,008 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:55:01,013 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:55:01,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01 WrapperNode [2023-08-30 02:55:01,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:55:01,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:55:01,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:55:01,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:55:01,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,075 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-30 02:55:01,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:55:01,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:55:01,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:55:01,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:55:01,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,133 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:55:01,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:55:01,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:55:01,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:55:01,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (1/1) ... [2023-08-30 02:55:01,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:55:01,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:55:01,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:55:01,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:55:01,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:55:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:55:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:55:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:55:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:55:01,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:55:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:55:01,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:55:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:55:01,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:55:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:55:01,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:55:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:55:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:55:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:55:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:55:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:55:01,222 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:55:01,410 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:55:01,412 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:55:01,746 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:55:01,870 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:55:01,871 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:55:01,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:55:01 BoogieIcfgContainer [2023-08-30 02:55:01,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:55:01,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:55:01,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:55:01,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:55:01,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:55:00" (1/3) ... [2023-08-30 02:55:01,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:55:01, skipping insertion in model container [2023-08-30 02:55:01,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:01" (2/3) ... [2023-08-30 02:55:01,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:55:01, skipping insertion in model container [2023-08-30 02:55:01,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:55:01" (3/3) ... [2023-08-30 02:55:01,881 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-08-30 02:55:01,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:55:01,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:55:01,897 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:55:01,962 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:55:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:55:02,084 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:55:02,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:02,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:55:02,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-30 02:55:02,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-30 02:55:02,096 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:55:02,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:55:02,106 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-30 02:55:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-30 02:55:02,128 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-30 02:55:02,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:02,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:55:02,131 INFO L119 LiptonReduction]: Number of co-enabled transitions 3128 [2023-08-30 02:55:08,982 INFO L134 LiptonReduction]: Checked pairs total: 7754 [2023-08-30 02:55:08,982 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-30 02:55:08,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:55:08,999 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;@7b1185ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:55:08,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:55:09,001 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:55:09,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:09,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:09,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:55:09,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:09,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2023-08-30 02:55:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:09,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548823948] [2023-08-30 02:55:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:09,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:09,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:09,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:09,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:55:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:09,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:55:09,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:09,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:09,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:09,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548823948] [2023-08-30 02:55:09,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548823948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:09,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:55:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963760204] [2023-08-30 02:55:09,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:09,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:55:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:55:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:55:09,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 283 [2023-08-30 02:55:09,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:09,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:09,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 283 [2023-08-30 02:55:09,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:09,811 INFO L130 PetriNetUnfolder]: 3632/5102 cut-off events. [2023-08-30 02:55:09,811 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-30 02:55:09,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10195 conditions, 5102 events. 3632/5102 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 26044 event pairs, 3632 based on Foata normal form. 0/4378 useless extension candidates. Maximal degree in co-relation 10183. Up to 4990 conditions per place. [2023-08-30 02:55:09,843 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:55:09,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-30 02:55:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:55:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:55:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-30 02:55:09,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229681978798587 [2023-08-30 02:55:09,855 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-30 02:55:09,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-30 02:55:09,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:09,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-30 02:55:09,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:09,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:09,865 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:09,867 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 296 transitions. [2023-08-30 02:55:09,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-30 02:55:09,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:55:09,872 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:55:09,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:55:09,876 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:55:09,876 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:55:09,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:09,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:09,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:09,886 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-30 02:55:10,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:10,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:10,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1487499190, now seen corresponding path program 1 times [2023-08-30 02:55:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:10,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888988288] [2023-08-30 02:55:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:10,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:10,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:55:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:10,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:55:10,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:10,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:10,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:10,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888988288] [2023-08-30 02:55:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888988288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:10,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:10,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:55:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611080535] [2023-08-30 02:55:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:10,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:55:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:10,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:55:10,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:55:10,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-30 02:55:10,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:10,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:10,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-30 02:55:10,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:10,691 INFO L130 PetriNetUnfolder]: 2891/4505 cut-off events. [2023-08-30 02:55:10,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:10,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 4505 events. 2891/4505 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26554 event pairs, 668 based on Foata normal form. 0/4213 useless extension candidates. Maximal degree in co-relation 8599. Up to 2980 conditions per place. [2023-08-30 02:55:10,713 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-30 02:55:10,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 164 flow [2023-08-30 02:55:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:55:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:55:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-30 02:55:10,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041224970553593 [2023-08-30 02:55:10,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-30 02:55:10,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-30 02:55:10,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:10,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-30 02:55:10,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:10,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:10,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:10,723 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 428 transitions. [2023-08-30 02:55:10,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 164 flow [2023-08-30 02:55:10,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:55:10,725 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:55:10,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:55:10,726 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:55:10,726 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:55:10,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:10,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:10,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:10,737 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 (3)] Ended with exit code 0 [2023-08-30 02:55:10,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:10,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:10,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash -737296888, now seen corresponding path program 1 times [2023-08-30 02:55:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414324693] [2023-08-30 02:55:10,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:10,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:10,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:10,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:10,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:55:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:11,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:55:11,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:11,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:11,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414324693] [2023-08-30 02:55:11,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414324693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:11,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:11,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:55:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480262714] [2023-08-30 02:55:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:11,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:55:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:11,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:55:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:55:11,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-30 02:55:11,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:11,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:11,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-30 02:55:11,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:11,562 INFO L130 PetriNetUnfolder]: 2063/3016 cut-off events. [2023-08-30 02:55:11,562 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-30 02:55:11,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6299 conditions, 3016 events. 2063/3016 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 15182 event pairs, 425 based on Foata normal form. 144/3039 useless extension candidates. Maximal degree in co-relation 6295. Up to 2373 conditions per place. [2023-08-30 02:55:11,578 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 34 selfloop transitions, 5 changer transitions 21/64 dead transitions. [2023-08-30 02:55:11,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 272 flow [2023-08-30 02:55:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:55:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:55:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2023-08-30 02:55:11,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48551236749116605 [2023-08-30 02:55:11,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2023-08-30 02:55:11,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2023-08-30 02:55:11,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:11,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2023-08-30 02:55:11,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:11,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:11,588 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:11,588 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 687 transitions. [2023-08-30 02:55:11,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 272 flow [2023-08-30 02:55:11,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:55:11,591 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-30 02:55:11,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:55:11,592 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-30 02:55:11,592 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-30 02:55:11,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:11,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:11,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:11,608 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-30 02:55:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:11,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:11,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash 223528187, now seen corresponding path program 1 times [2023-08-30 02:55:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261224985] [2023-08-30 02:55:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:11,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:11,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:55:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:11,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:55:11,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:11,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:11,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261224985] [2023-08-30 02:55:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261224985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174347379] [2023-08-30 02:55:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:11,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:55:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:55:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:55:11,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-30 02:55:11,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:11,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:11,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-30 02:55:11,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:12,303 INFO L130 PetriNetUnfolder]: 1079/1696 cut-off events. [2023-08-30 02:55:12,304 INFO L131 PetriNetUnfolder]: For 754/754 co-relation queries the response was YES. [2023-08-30 02:55:12,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 1696 events. 1079/1696 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8117 event pairs, 161 based on Foata normal form. 108/1747 useless extension candidates. Maximal degree in co-relation 4719. Up to 883 conditions per place. [2023-08-30 02:55:12,314 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 44 selfloop transitions, 9 changer transitions 21/78 dead transitions. [2023-08-30 02:55:12,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 78 transitions, 409 flow [2023-08-30 02:55:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:55:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:55:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-08-30 02:55:12,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48645465253239106 [2023-08-30 02:55:12,317 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-08-30 02:55:12,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-08-30 02:55:12,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:12,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-08-30 02:55:12,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:12,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:12,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:12,324 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 826 transitions. [2023-08-30 02:55:12,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 78 transitions, 409 flow [2023-08-30 02:55:12,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:55:12,330 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-30 02:55:12,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 02:55:12,330 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:55:12,331 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-30 02:55:12,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:12,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:12,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:12,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:12,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:12,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:12,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1786509360, now seen corresponding path program 1 times [2023-08-30 02:55:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324984234] [2023-08-30 02:55:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:12,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:12,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:12,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:55:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:12,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:55:12,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:12,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:12,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324984234] [2023-08-30 02:55:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324984234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:12,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:12,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:55:12,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221146187] [2023-08-30 02:55:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:12,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:55:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:55:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:55:12,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-30 02:55:12,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:12,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:12,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-30 02:55:12,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:13,032 INFO L130 PetriNetUnfolder]: 566/938 cut-off events. [2023-08-30 02:55:13,032 INFO L131 PetriNetUnfolder]: For 1069/1069 co-relation queries the response was YES. [2023-08-30 02:55:13,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 938 events. 566/938 cut-off events. For 1069/1069 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4018 event pairs, 104 based on Foata normal form. 48/966 useless extension candidates. Maximal degree in co-relation 3081. Up to 351 conditions per place. [2023-08-30 02:55:13,039 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 52 selfloop transitions, 13 changer transitions 21/90 dead transitions. [2023-08-30 02:55:13,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 566 flow [2023-08-30 02:55:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:55:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:55:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 963 transitions. [2023-08-30 02:55:13,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48611812216052497 [2023-08-30 02:55:13,042 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 963 transitions. [2023-08-30 02:55:13,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 963 transitions. [2023-08-30 02:55:13,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:13,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 963 transitions. [2023-08-30 02:55:13,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.57142857142858) internal successors, (963), 7 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,049 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,049 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 963 transitions. [2023-08-30 02:55:13,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 566 flow [2023-08-30 02:55:13,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 90 transitions, 504 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:55:13,058 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-30 02:55:13,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-30 02:55:13,059 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:55:13,059 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-30 02:55:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:13,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:13,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:13,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:13,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:13,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1366822904, now seen corresponding path program 1 times [2023-08-30 02:55:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453283512] [2023-08-30 02:55:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:13,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:13,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:13,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:55:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:13,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:55:13,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:13,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:13,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453283512] [2023-08-30 02:55:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453283512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:13,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:55:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53893392] [2023-08-30 02:55:13,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:13,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:55:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:55:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:55:13,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-30 02:55:13,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:13,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-30 02:55:13,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:13,861 INFO L130 PetriNetUnfolder]: 452/737 cut-off events. [2023-08-30 02:55:13,861 INFO L131 PetriNetUnfolder]: For 804/804 co-relation queries the response was YES. [2023-08-30 02:55:13,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 737 events. 452/737 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 99 based on Foata normal form. 11/738 useless extension candidates. Maximal degree in co-relation 2320. Up to 290 conditions per place. [2023-08-30 02:55:13,869 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 48 selfloop transitions, 17 changer transitions 11/80 dead transitions. [2023-08-30 02:55:13,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 514 flow [2023-08-30 02:55:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:55:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:55:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions. [2023-08-30 02:55:13,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47614840989399293 [2023-08-30 02:55:13,873 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions. [2023-08-30 02:55:13,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions. [2023-08-30 02:55:13,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:13,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions. [2023-08-30 02:55:13,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,880 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,880 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1078 transitions. [2023-08-30 02:55:13,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 514 flow [2023-08-30 02:55:13,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 452 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:55:13,888 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-30 02:55:13,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 02:55:13,891 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-30 02:55:13,891 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-30 02:55:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:13,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:13,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:13,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:14,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:14,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:14,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1476613069, now seen corresponding path program 1 times [2023-08-30 02:55:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137576960] [2023-08-30 02:55:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:14,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:14,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:14,104 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:14,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:55:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:14,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:55:14,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:14,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:14,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137576960] [2023-08-30 02:55:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137576960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:55:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355349822] [2023-08-30 02:55:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:14,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:55:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:55:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:55:14,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-30 02:55:14,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:14,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:14,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-30 02:55:14,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:14,535 INFO L130 PetriNetUnfolder]: 777/1338 cut-off events. [2023-08-30 02:55:14,536 INFO L131 PetriNetUnfolder]: For 1849/1849 co-relation queries the response was YES. [2023-08-30 02:55:14,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4045 conditions, 1338 events. 777/1338 cut-off events. For 1849/1849 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6946 event pairs, 128 based on Foata normal form. 0/1329 useless extension candidates. Maximal degree in co-relation 4034. Up to 637 conditions per place. [2023-08-30 02:55:14,549 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 81 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-30 02:55:14,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 661 flow [2023-08-30 02:55:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:55:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:55:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-30 02:55:14,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49646643109540634 [2023-08-30 02:55:14,553 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-30 02:55:14,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-30 02:55:14,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:14,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-30 02:55:14,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:14,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:14,558 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:14,558 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 4 states and 562 transitions. [2023-08-30 02:55:14,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 661 flow [2023-08-30 02:55:14,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 86 transitions, 520 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-30 02:55:14,574 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 165 flow [2023-08-30 02:55:14,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-30 02:55:14,574 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-30 02:55:14,575 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 165 flow [2023-08-30 02:55:14,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:14,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:14,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:14,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:14,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:14,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:14,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash -682320797, now seen corresponding path program 2 times [2023-08-30 02:55:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364792091] [2023-08-30 02:55:14,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:55:14,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:14,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:14,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:14,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:55:14,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:55:14,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:55:14,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:55:14,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:14,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:14,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364792091] [2023-08-30 02:55:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364792091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:55:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240493027] [2023-08-30 02:55:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:14,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:55:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:55:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:55:14,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-30 02:55:14,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:14,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:14,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-30 02:55:14,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:15,223 INFO L130 PetriNetUnfolder]: 930/1583 cut-off events. [2023-08-30 02:55:15,224 INFO L131 PetriNetUnfolder]: For 1788/1788 co-relation queries the response was YES. [2023-08-30 02:55:15,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 1583 events. 930/1583 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8390 event pairs, 130 based on Foata normal form. 1/1568 useless extension candidates. Maximal degree in co-relation 4678. Up to 897 conditions per place. [2023-08-30 02:55:15,234 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 79 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2023-08-30 02:55:15,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 529 flow [2023-08-30 02:55:15,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:55:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:55:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-08-30 02:55:15,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49469964664310956 [2023-08-30 02:55:15,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-08-30 02:55:15,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-08-30 02:55:15,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:15,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-08-30 02:55:15,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,241 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 165 flow. Second operand 4 states and 560 transitions. [2023-08-30 02:55:15,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 529 flow [2023-08-30 02:55:15,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:55:15,257 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 177 flow [2023-08-30 02:55:15,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-30 02:55:15,257 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-30 02:55:15,258 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 177 flow [2023-08-30 02:55:15,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:15,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:15,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:15,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:15,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:15,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 953607371, now seen corresponding path program 3 times [2023-08-30 02:55:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:15,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688286] [2023-08-30 02:55:15,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:55:15,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:15,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:15,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:55:15,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:55:15,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:55:15,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:55:15,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:55:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:15,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:55:15,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:55:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688286] [2023-08-30 02:55:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:15,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:15,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:55:15,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532344711] [2023-08-30 02:55:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:15,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:55:15,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:55:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:55:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:55:15,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-08-30 02:55:15,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:15,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-08-30 02:55:15,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:15,895 INFO L130 PetriNetUnfolder]: 1599/2628 cut-off events. [2023-08-30 02:55:15,896 INFO L131 PetriNetUnfolder]: For 2605/2606 co-relation queries the response was YES. [2023-08-30 02:55:15,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8013 conditions, 2628 events. 1599/2628 cut-off events. For 2605/2606 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14954 event pairs, 639 based on Foata normal form. 1/2546 useless extension candidates. Maximal degree in co-relation 8001. Up to 1492 conditions per place. [2023-08-30 02:55:15,911 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 63 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-30 02:55:15,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 436 flow [2023-08-30 02:55:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:55:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:55:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-30 02:55:15,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017667844522968 [2023-08-30 02:55:15,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-30 02:55:15,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-30 02:55:15,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:15,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-30 02:55:15,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,917 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 177 flow. Second operand 3 states and 426 transitions. [2023-08-30 02:55:15,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 436 flow [2023-08-30 02:55:15,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:55:15,947 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 188 flow [2023-08-30 02:55:15,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-30 02:55:15,948 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-30 02:55:15,948 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 188 flow [2023-08-30 02:55:15,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:15,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:15,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:15,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:16,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:16,157 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:16,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -966760871, now seen corresponding path program 4 times [2023-08-30 02:55:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:55:16,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395751596] [2023-08-30 02:55:16,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:55:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:16,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:55:16,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:55:16,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:55:16,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:55:16,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:55:16,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:55:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:55:16,420 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:55:16,420 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:55:16,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:55:16,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:55:16,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:55:16,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:55:16,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:55:16,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:55:16,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:55:16,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:55:16,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:55:16,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:55:16,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 02:55:16,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:55:16,656 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:16,660 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:55:16,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:55:16,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:55:16 BasicIcfg [2023-08-30 02:55:16,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:55:16,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:55:16,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:55:16,736 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:55:16,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:55:01" (3/4) ... [2023-08-30 02:55:16,738 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:55:16,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:55:16,739 INFO L158 Benchmark]: Toolchain (without parser) took 16283.72ms. Allocated memory was 75.5MB in the beginning and 541.1MB in the end (delta: 465.6MB). Free memory was 56.9MB in the beginning and 299.8MB in the end (delta: -243.0MB). Peak memory consumption was 222.0MB. Max. memory is 16.1GB. [2023-08-30 02:55:16,739 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:55:16,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.32ms. Allocated memory is still 75.5MB. Free memory was 56.6MB in the beginning and 32.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 02:55:16,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.20ms. Allocated memory is still 75.5MB. Free memory was 32.9MB in the beginning and 53.7MB in the end (delta: -20.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 02:55:16,740 INFO L158 Benchmark]: Boogie Preprocessor took 61.76ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:55:16,740 INFO L158 Benchmark]: RCFGBuilder took 726.81ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 51.6MB in the beginning and 55.9MB in the end (delta: -4.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2023-08-30 02:55:16,741 INFO L158 Benchmark]: TraceAbstraction took 14860.56ms. Allocated memory was 96.5MB in the beginning and 541.1MB in the end (delta: 444.6MB). Free memory was 55.3MB in the beginning and 299.8MB in the end (delta: -244.5MB). Peak memory consumption was 199.5MB. Max. memory is 16.1GB. [2023-08-30 02:55:16,741 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 541.1MB. Free memory is still 299.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:55:16,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.32ms. Allocated memory is still 75.5MB. Free memory was 56.6MB in the beginning and 32.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.20ms. Allocated memory is still 75.5MB. Free memory was 32.9MB in the beginning and 53.7MB in the end (delta: -20.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.76ms. Allocated memory is still 75.5MB. Free memory was 53.7MB in the beginning and 51.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 726.81ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 51.6MB in the beginning and 55.9MB in the end (delta: -4.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14860.56ms. Allocated memory was 96.5MB in the beginning and 541.1MB in the end (delta: 444.6MB). Free memory was 55.3MB in the beginning and 299.8MB in the end (delta: -244.5MB). Peak memory consumption was 199.5MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 541.1MB. Free memory is still 299.8MB. 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: 6.9s, 150 PlacesBefore, 50 PlacesAfterwards, 139 TransitionsBefore, 38 TransitionsAfterwards, 3128 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 7754 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3634, independent: 3438, independent conditional: 0, independent unconditional: 3438, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1727, independent: 1688, independent conditional: 0, independent unconditional: 1688, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3634, independent: 1750, independent conditional: 0, independent unconditional: 1750, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1727, unknown conditional: 0, unknown unconditional: 1727] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1029, ((void *)0), P0, ((void *)0))=0, t1029={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1030, ((void *)0), P1, ((void *)0))=1, t1029={11:0}, t1030={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1031, ((void *)0), P2, ((void *)0))=2, t1029={11:0}, t1030={15:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1032, ((void *)0), P3, ((void *)0))=3, t1029={11:0}, t1030={15:0}, t1031={7:0}, t1032={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={11:0}, t1030={15:0}, t1031={7:0}, t1032={-2147483637:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1366 IncrementalHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 7 mSDtfsCounter, 1366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1274 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:55:16,777 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