./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.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/mix043.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --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:55:19,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:55:19,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:55:19,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:55:19,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:55:19,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:55:19,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:55:19,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:55:19,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:55:19,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:55:19,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:55:19,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:55:19,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:55:19,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:55:19,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:55:19,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:55:19,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:55:19,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:55:19,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:55:19,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:55:19,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:55:19,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:55:19,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:55:19,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:55:19,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:55:19,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:55:19,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:55:19,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:55:19,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:55:19,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:55:19,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:55:19,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:55:19,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:55:19,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:55:19,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:55:19,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:55:19,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:55:19,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:55:19,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:55:19,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:55:19,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:55:19,913 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:55:19,942 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:55:19,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:55:19,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:55:19,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:55:19,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:55:19,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:55:19,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:55:19,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:55:19,946 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:55:19,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:55:19,947 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:55:19,947 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:55:19,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:55:19,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:55:19,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:55:19,948 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:55:19,948 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:55:19,948 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:55:19,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:55:19,949 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:55:19,949 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:55:19,949 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:55:19,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:55:19,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:55:19,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:55:19,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:55:19,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:55:19,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:55:19,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:55:19,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:55:19,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:55:19,951 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:55:19,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:55:19,952 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:55:19,952 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 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:55:20,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:55:20,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:55:20,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:55:20,305 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:55:20,305 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:55:20,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-30 02:55:21,488 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:55:21,809 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:55:21,809 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-30 02:55:21,828 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413e21823/23a567b8891444ef9a1e51d3155cc083/FLAGbb3af7036 [2023-08-30 02:55:21,853 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413e21823/23a567b8891444ef9a1e51d3155cc083 [2023-08-30 02:55:21,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:55:21,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:55:21,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:55:21,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:55:21,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:55:21,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:55:21" (1/1) ... [2023-08-30 02:55:21,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170a0f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:21, skipping insertion in model container [2023-08-30 02:55:21,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:55:21" (1/1) ... [2023-08-30 02:55:21,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:55:21,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:55:22,053 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/mix043.oepc.i[945,958] [2023-08-30 02:55:22,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:55:22,203 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:55:22,220 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/mix043.oepc.i[945,958] [2023-08-30 02:55:22,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:55:22,366 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:55:22,367 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:55:22,373 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:55:22,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:22 WrapperNode [2023-08-30 02:55:22,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:55:22,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:55:22,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:55:22,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:55:22,381 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:22" (1/1) ... [2023-08-30 02:55:22,395 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:22" (1/1) ... [2023-08-30 02:55:22,427 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 02:55:22,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:55:22,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:55:22,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:55:22,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:55:22,434 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:22" (1/1) ... [2023-08-30 02:55:22,435 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:22" (1/1) ... [2023-08-30 02:55:22,438 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:22" (1/1) ... [2023-08-30 02:55:22,442 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:22" (1/1) ... [2023-08-30 02:55:22,457 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:22" (1/1) ... [2023-08-30 02:55:22,459 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:22" (1/1) ... [2023-08-30 02:55:22,461 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:22" (1/1) ... [2023-08-30 02:55:22,462 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:22" (1/1) ... [2023-08-30 02:55:22,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:55:22,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:55:22,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:55:22,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:55:22,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:22" (1/1) ... [2023-08-30 02:55:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:55:22,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:55:22,500 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:22,503 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:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:55:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:55:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:55:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:55:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:55:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:55:22,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:55:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:55:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:55:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:55:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:55:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:55:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:55:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:55:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:55:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:55:22,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:55:22,546 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:22,714 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:55:22,730 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:55:23,115 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:55:23,256 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:55:23,256 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:55:23,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:55:23 BoogieIcfgContainer [2023-08-30 02:55:23,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:55:23,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:55:23,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:55:23,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:55:23,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:55:21" (1/3) ... [2023-08-30 02:55:23,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6777431a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:55:23, skipping insertion in model container [2023-08-30 02:55:23,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:55:22" (2/3) ... [2023-08-30 02:55:23,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6777431a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:55:23, skipping insertion in model container [2023-08-30 02:55:23,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:55:23" (3/3) ... [2023-08-30 02:55:23,266 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-08-30 02:55:23,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:55:23,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:55:23,283 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:55:23,350 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:55:23,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:55:23,459 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:55:23,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:23,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:55:23,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-30 02:55:23,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-30 02:55:23,478 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:55:23,499 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:55:23,503 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-30 02:55:23,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-30 02:55:23,554 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-30 02:55:23,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:23,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:55:23,559 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-30 02:55:28,261 INFO L134 LiptonReduction]: Checked pairs total: 10048 [2023-08-30 02:55:28,261 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-30 02:55:28,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:55:28,277 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;@76942b9f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:55:28,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:55:28,278 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:55:28,278 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:28,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:28,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:55:28,279 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:28,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2023-08-30 02:55:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:28,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53576174] [2023-08-30 02:55:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:28,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:28,376 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:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53576174] [2023-08-30 02:55:28,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53576174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:28,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:28,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:55:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675933711] [2023-08-30 02:55:28,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:55:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:55:28,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:55:28,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-08-30 02:55:28,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 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:55:28,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:28,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-08-30 02:55:28,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:29,804 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2023-08-30 02:55:29,805 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 02:55:29,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 52520 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2023-08-30 02:55:29,875 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-30 02:55:29,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-30 02:55:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:55:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:55:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-30 02:55:29,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212014134275619 [2023-08-30 02:55:29,895 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-30 02:55:29,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-30 02:55:29,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:29,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-30 02:55:29,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:29,907 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:29,907 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:29,909 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 295 transitions. [2023-08-30 02:55:29,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-30 02:55:29,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:55:29,915 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-30 02:55:29,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-30 02:55:29,919 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-30 02:55:29,920 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-30 02:55:29,920 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:55:29,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:29,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:55:29,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:55:29,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:29,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash 605298, now seen corresponding path program 1 times [2023-08-30 02:55:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800228020] [2023-08-30 02:55:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:30,181 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:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:30,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800228020] [2023-08-30 02:55:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800228020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:30,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:30,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:55:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415932518] [2023-08-30 02:55:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:30,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:55:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:55:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:55:30,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-08-30 02:55:30,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:30,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:30,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-08-30 02:55:30,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:31,149 INFO L130 PetriNetUnfolder]: 5879/8050 cut-off events. [2023-08-30 02:55:31,150 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:55:31,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16191 conditions, 8050 events. 5879/8050 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39630 event pairs, 3031 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 16188. Up to 6367 conditions per place. [2023-08-30 02:55:31,198 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-30 02:55:31,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-30 02:55:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:55:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:55:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-30 02:55:31,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123674911660777 [2023-08-30 02:55:31,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-30 02:55:31,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-30 02:55:31,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:31,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-30 02:55:31,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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:31,205 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:31,206 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:31,206 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 435 transitions. [2023-08-30 02:55:31,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-30 02:55:31,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:55:31,207 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-30 02:55:31,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 02:55:31,208 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-30 02:55:31,209 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-30 02:55:31,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:31,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:31,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:31,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:55:31,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:31,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -587374610, now seen corresponding path program 1 times [2023-08-30 02:55:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658909439] [2023-08-30 02:55:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:31,605 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:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658909439] [2023-08-30 02:55:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658909439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:31,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:55:31,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555920856] [2023-08-30 02:55:31,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:31,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:55:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:31,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:55:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:55:31,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:55:31,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 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:55:31,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:31,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:55:31,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:34,031 INFO L130 PetriNetUnfolder]: 18849/25498 cut-off events. [2023-08-30 02:55:34,031 INFO L131 PetriNetUnfolder]: For 1295/1295 co-relation queries the response was YES. [2023-08-30 02:55:34,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52735 conditions, 25498 events. 18849/25498 cut-off events. For 1295/1295 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 135494 event pairs, 6992 based on Foata normal form. 0/24768 useless extension candidates. Maximal degree in co-relation 52731. Up to 16383 conditions per place. [2023-08-30 02:55:34,160 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-08-30 02:55:34,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2023-08-30 02:55:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:55:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:55:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-30 02:55:34,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48998822143698467 [2023-08-30 02:55:34,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-30 02:55:34,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-30 02:55:34,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:34,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-30 02:55:34,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:34,166 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:34,166 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:34,167 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 416 transitions. [2023-08-30 02:55:34,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2023-08-30 02:55:34,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:55:34,169 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2023-08-30 02:55:34,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-30 02:55:34,171 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-30 02:55:34,174 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2023-08-30 02:55:34,175 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:55:34,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:34,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:34,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:55:34,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:34,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -587374603, now seen corresponding path program 1 times [2023-08-30 02:55:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:34,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271276902] [2023-08-30 02:55:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:34,736 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:34,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:34,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271276902] [2023-08-30 02:55:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271276902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:34,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354370656] [2023-08-30 02:55:34,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:34,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:55:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:55:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:55:34,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-30 02:55:34,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:34,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:34,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-30 02:55:34,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:36,770 INFO L130 PetriNetUnfolder]: 13076/18349 cut-off events. [2023-08-30 02:55:36,771 INFO L131 PetriNetUnfolder]: For 5123/5256 co-relation queries the response was YES. [2023-08-30 02:55:36,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42596 conditions, 18349 events. 13076/18349 cut-off events. For 5123/5256 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 102996 event pairs, 2091 based on Foata normal form. 616/18790 useless extension candidates. Maximal degree in co-relation 42591. Up to 13175 conditions per place. [2023-08-30 02:55:36,914 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 53 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2023-08-30 02:55:36,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 304 flow [2023-08-30 02:55:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:55:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:55:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-30 02:55:36,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43286219081272087 [2023-08-30 02:55:36,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-30 02:55:36,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-30 02:55:36,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:36,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-30 02:55:36,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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:36,928 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:36,929 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:36,929 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 6 states and 735 transitions. [2023-08-30 02:55:36,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 304 flow [2023-08-30 02:55:36,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:55:36,982 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 133 flow [2023-08-30 02:55:36,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-30 02:55:36,984 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-30 02:55:36,984 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 133 flow [2023-08-30 02:55:36,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:36,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:36,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:36,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:55:36,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:36,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1834465806, now seen corresponding path program 1 times [2023-08-30 02:55:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:36,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825484000] [2023-08-30 02:55:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:37,494 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:37,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:37,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825484000] [2023-08-30 02:55:37,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825484000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:37,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:37,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001000841] [2023-08-30 02:55:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:37,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:55:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:55:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:55:37,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 283 [2023-08-30 02:55:37,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:37,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:37,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 283 [2023-08-30 02:55:37,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:38,675 INFO L130 PetriNetUnfolder]: 9337/13402 cut-off events. [2023-08-30 02:55:38,675 INFO L131 PetriNetUnfolder]: For 3289/3607 co-relation queries the response was YES. [2023-08-30 02:55:38,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30210 conditions, 13402 events. 9337/13402 cut-off events. For 3289/3607 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 76565 event pairs, 3470 based on Foata normal form. 335/13412 useless extension candidates. Maximal degree in co-relation 30204. Up to 12162 conditions per place. [2023-08-30 02:55:38,772 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 40 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-30 02:55:38,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 245 flow [2023-08-30 02:55:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:55:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:55:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-30 02:55:38,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175500588928151 [2023-08-30 02:55:38,776 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-30 02:55:38,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-30 02:55:38,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:38,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-30 02:55:38,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:38,781 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:38,782 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:38,782 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 133 flow. Second operand 6 states and 709 transitions. [2023-08-30 02:55:38,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 245 flow [2023-08-30 02:55:38,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 233 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 02:55:38,786 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 117 flow [2023-08-30 02:55:38,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-08-30 02:55:38,787 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-30 02:55:38,787 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 117 flow [2023-08-30 02:55:38,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:38,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:38,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:38,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:55:38,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:38,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1828209703, now seen corresponding path program 1 times [2023-08-30 02:55:38,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:38,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992456332] [2023-08-30 02:55:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:39,121 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:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:39,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992456332] [2023-08-30 02:55:39,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992456332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:39,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:55:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230597320] [2023-08-30 02:55:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:39,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:55:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:55:39,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:55:39,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-30 02:55:39,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:39,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:39,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-30 02:55:39,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:40,244 INFO L130 PetriNetUnfolder]: 8287/12303 cut-off events. [2023-08-30 02:55:40,244 INFO L131 PetriNetUnfolder]: For 1894/2309 co-relation queries the response was YES. [2023-08-30 02:55:40,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27362 conditions, 12303 events. 8287/12303 cut-off events. For 1894/2309 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 76402 event pairs, 1555 based on Foata normal form. 936/13028 useless extension candidates. Maximal degree in co-relation 27356. Up to 5222 conditions per place. [2023-08-30 02:55:40,315 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 57 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-30 02:55:40,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 346 flow [2023-08-30 02:55:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:55:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:55:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-30 02:55:40,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48674911660777387 [2023-08-30 02:55:40,318 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-30 02:55:40,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-30 02:55:40,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:40,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-30 02:55:40,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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:40,322 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:40,322 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:40,322 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 117 flow. Second operand 4 states and 551 transitions. [2023-08-30 02:55:40,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 346 flow [2023-08-30 02:55:40,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:55:40,325 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 156 flow [2023-08-30 02:55:40,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-30 02:55:40,326 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-30 02:55:40,326 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 156 flow [2023-08-30 02:55:40,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:40,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:40,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:40,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:55:40,327 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:40,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash 980542762, now seen corresponding path program 1 times [2023-08-30 02:55:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:40,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777541166] [2023-08-30 02:55:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:40,598 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:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:40,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777541166] [2023-08-30 02:55:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777541166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:40,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:40,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887223459] [2023-08-30 02:55:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:40,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:55:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:40,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:55:40,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:55:40,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-30 02:55:40,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:40,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:40,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-30 02:55:40,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:41,535 INFO L130 PetriNetUnfolder]: 6497/9975 cut-off events. [2023-08-30 02:55:41,535 INFO L131 PetriNetUnfolder]: For 4241/4512 co-relation queries the response was YES. [2023-08-30 02:55:41,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27380 conditions, 9975 events. 6497/9975 cut-off events. For 4241/4512 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 63165 event pairs, 1455 based on Foata normal form. 624/10382 useless extension candidates. Maximal degree in co-relation 27372. Up to 3749 conditions per place. [2023-08-30 02:55:41,582 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 73 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2023-08-30 02:55:41,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 483 flow [2023-08-30 02:55:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:55:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:55:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-08-30 02:55:41,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4890459363957597 [2023-08-30 02:55:41,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-08-30 02:55:41,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-08-30 02:55:41,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:41,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-08-30 02:55:41,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:41,591 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:41,591 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:41,591 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 156 flow. Second operand 5 states and 692 transitions. [2023-08-30 02:55:41,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 483 flow [2023-08-30 02:55:41,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:55:41,596 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 221 flow [2023-08-30 02:55:41,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-30 02:55:41,597 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-30 02:55:41,597 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 221 flow [2023-08-30 02:55:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:41,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:41,598 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:41,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:55:41,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:41,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1543424239, now seen corresponding path program 1 times [2023-08-30 02:55:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842885639] [2023-08-30 02:55:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:42,581 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:42,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842885639] [2023-08-30 02:55:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842885639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:42,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:42,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825992498] [2023-08-30 02:55:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:42,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:55:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:55:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:55:42,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-30 02:55:42,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:42,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:42,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-30 02:55:42,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:44,746 INFO L130 PetriNetUnfolder]: 15199/22064 cut-off events. [2023-08-30 02:55:44,746 INFO L131 PetriNetUnfolder]: For 34612/34612 co-relation queries the response was YES. [2023-08-30 02:55:44,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72196 conditions, 22064 events. 15199/22064 cut-off events. For 34612/34612 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 136407 event pairs, 1671 based on Foata normal form. 56/22120 useless extension candidates. Maximal degree in co-relation 72186. Up to 8712 conditions per place. [2023-08-30 02:55:44,885 INFO L137 encePairwiseOnDemand]: 269/283 looper letters, 142 selfloop transitions, 41 changer transitions 15/198 dead transitions. [2023-08-30 02:55:44,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 198 transitions, 1422 flow [2023-08-30 02:55:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:55:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:55:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-30 02:55:44,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669358909641595 [2023-08-30 02:55:44,889 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-30 02:55:44,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-30 02:55:44,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:44,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-30 02:55:44,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states 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:44,895 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:44,896 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:44,896 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 221 flow. Second operand 7 states and 925 transitions. [2023-08-30 02:55:44,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 198 transitions, 1422 flow [2023-08-30 02:55:44,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 198 transitions, 1348 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-08-30 02:55:44,925 INFO L231 Difference]: Finished difference. Result has 60 places, 82 transitions, 522 flow [2023-08-30 02:55:44,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=522, PETRI_PLACES=60, PETRI_TRANSITIONS=82} [2023-08-30 02:55:44,926 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-30 02:55:44,926 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 82 transitions, 522 flow [2023-08-30 02:55:44,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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:44,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:44,926 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:44,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:55:44,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:44,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash -712638407, now seen corresponding path program 2 times [2023-08-30 02:55:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:44,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614897654] [2023-08-30 02:55:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:55:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614897654] [2023-08-30 02:55:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614897654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:55:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743209429] [2023-08-30 02:55:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:45,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:55:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:55:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:55:45,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-30 02:55:45,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 82 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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:45,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:45,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-30 02:55:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:46,202 INFO L130 PetriNetUnfolder]: 4973/7861 cut-off events. [2023-08-30 02:55:46,202 INFO L131 PetriNetUnfolder]: For 14646/15243 co-relation queries the response was YES. [2023-08-30 02:55:46,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29164 conditions, 7861 events. 4973/7861 cut-off events. For 14646/15243 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 49070 event pairs, 535 based on Foata normal form. 744/8502 useless extension candidates. Maximal degree in co-relation 29150. Up to 2634 conditions per place. [2023-08-30 02:55:46,248 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 169 selfloop transitions, 14 changer transitions 15/217 dead transitions. [2023-08-30 02:55:46,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 217 transitions, 1594 flow [2023-08-30 02:55:46,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:55:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:55:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-08-30 02:55:46,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882214369846879 [2023-08-30 02:55:46,251 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-08-30 02:55:46,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-08-30 02:55:46,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:46,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-08-30 02:55:46,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:46,256 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:46,257 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:46,257 INFO L175 Difference]: Start difference. First operand has 60 places, 82 transitions, 522 flow. Second operand 6 states and 829 transitions. [2023-08-30 02:55:46,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 217 transitions, 1594 flow [2023-08-30 02:55:46,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 217 transitions, 1552 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 02:55:46,404 INFO L231 Difference]: Finished difference. Result has 64 places, 86 transitions, 571 flow [2023-08-30 02:55:46,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=64, PETRI_TRANSITIONS=86} [2023-08-30 02:55:46,405 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-30 02:55:46,405 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 86 transitions, 571 flow [2023-08-30 02:55:46,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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:46,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:46,405 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:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:55:46,406 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:46,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1667848334, now seen corresponding path program 1 times [2023-08-30 02:55:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287701037] [2023-08-30 02:55:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:46,653 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:46,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:46,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287701037] [2023-08-30 02:55:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287701037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:46,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:55:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497058093] [2023-08-30 02:55:46,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:46,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:55:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:55:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:55:46,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 283 [2023-08-30 02:55:46,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 86 transitions, 571 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:55:46,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:46,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 283 [2023-08-30 02:55:46,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:47,681 INFO L130 PetriNetUnfolder]: 8272/12474 cut-off events. [2023-08-30 02:55:47,682 INFO L131 PetriNetUnfolder]: For 26030/26030 co-relation queries the response was YES. [2023-08-30 02:55:47,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50097 conditions, 12474 events. 8272/12474 cut-off events. For 26030/26030 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 73471 event pairs, 1344 based on Foata normal form. 18/12492 useless extension candidates. Maximal degree in co-relation 50082. Up to 6967 conditions per place. [2023-08-30 02:55:47,810 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 106 selfloop transitions, 14 changer transitions 32/152 dead transitions. [2023-08-30 02:55:47,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 152 transitions, 1289 flow [2023-08-30 02:55:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:55:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:55:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-30 02:55:47,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47791519434628976 [2023-08-30 02:55:47,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-30 02:55:47,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-30 02:55:47,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:47,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-30 02:55:47,814 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:55:47,816 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:47,816 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:47,816 INFO L175 Difference]: Start difference. First operand has 64 places, 86 transitions, 571 flow. Second operand 4 states and 541 transitions. [2023-08-30 02:55:47,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 152 transitions, 1289 flow [2023-08-30 02:55:48,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 152 transitions, 1229 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-30 02:55:48,048 INFO L231 Difference]: Finished difference. Result has 66 places, 81 transitions, 553 flow [2023-08-30 02:55:48,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=66, PETRI_TRANSITIONS=81} [2023-08-30 02:55:48,049 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-30 02:55:48,049 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 81 transitions, 553 flow [2023-08-30 02:55:48,049 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:55:48,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:48,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:48,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:55:48,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:48,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:48,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1674288440, now seen corresponding path program 1 times [2023-08-30 02:55:48,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:48,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128033509] [2023-08-30 02:55:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:48,527 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:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:48,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128033509] [2023-08-30 02:55:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128033509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:55:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517059630] [2023-08-30 02:55:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:48,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:55:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:48,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:55:48,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:55:48,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 283 [2023-08-30 02:55:48,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 81 transitions, 553 flow. Second operand has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:48,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:48,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 283 [2023-08-30 02:55:48,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:50,159 INFO L130 PetriNetUnfolder]: 10284/15585 cut-off events. [2023-08-30 02:55:50,160 INFO L131 PetriNetUnfolder]: For 27947/27947 co-relation queries the response was YES. [2023-08-30 02:55:50,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62220 conditions, 15585 events. 10284/15585 cut-off events. For 27947/27947 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 97656 event pairs, 1063 based on Foata normal form. 13/15598 useless extension candidates. Maximal degree in co-relation 62203. Up to 6460 conditions per place. [2023-08-30 02:55:50,266 INFO L137 encePairwiseOnDemand]: 269/283 looper letters, 166 selfloop transitions, 46 changer transitions 106/318 dead transitions. [2023-08-30 02:55:50,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 318 transitions, 2590 flow [2023-08-30 02:55:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:55:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:55:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1460 transitions. [2023-08-30 02:55:50,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46900096370061034 [2023-08-30 02:55:50,272 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1460 transitions. [2023-08-30 02:55:50,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1460 transitions. [2023-08-30 02:55:50,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:50,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1460 transitions. [2023-08-30 02:55:50,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 132.72727272727272) internal successors, (1460), 11 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states 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:50,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states 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:50,280 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states 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:50,280 INFO L175 Difference]: Start difference. First operand has 66 places, 81 transitions, 553 flow. Second operand 11 states and 1460 transitions. [2023-08-30 02:55:50,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 318 transitions, 2590 flow [2023-08-30 02:55:50,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 318 transitions, 2496 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-30 02:55:50,718 INFO L231 Difference]: Finished difference. Result has 78 places, 99 transitions, 803 flow [2023-08-30 02:55:50,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=803, PETRI_PLACES=78, PETRI_TRANSITIONS=99} [2023-08-30 02:55:50,719 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2023-08-30 02:55:50,719 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 99 transitions, 803 flow [2023-08-30 02:55:50,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:50,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:50,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:50,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:55:50,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:50,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1725010486, now seen corresponding path program 2 times [2023-08-30 02:55:50,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:50,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205334270] [2023-08-30 02:55:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:50,978 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:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205334270] [2023-08-30 02:55:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205334270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144029264] [2023-08-30 02:55:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:50,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:55:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:55:50,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:55:50,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-30 02:55:50,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 99 transitions, 803 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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:50,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:50,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-30 02:55:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:52,335 INFO L130 PetriNetUnfolder]: 9822/14996 cut-off events. [2023-08-30 02:55:52,335 INFO L131 PetriNetUnfolder]: For 35517/35517 co-relation queries the response was YES. [2023-08-30 02:55:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63354 conditions, 14996 events. 9822/14996 cut-off events. For 35517/35517 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 95063 event pairs, 935 based on Foata normal form. 16/15012 useless extension candidates. Maximal degree in co-relation 63333. Up to 6194 conditions per place. [2023-08-30 02:55:52,448 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 148 selfloop transitions, 35 changer transitions 88/271 dead transitions. [2023-08-30 02:55:52,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 271 transitions, 2503 flow [2023-08-30 02:55:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:55:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:55:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-30 02:55:52,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48115429917550057 [2023-08-30 02:55:52,450 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-30 02:55:52,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-30 02:55:52,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:52,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-30 02:55:52,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:55:52,455 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:52,455 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:52,455 INFO L175 Difference]: Start difference. First operand has 78 places, 99 transitions, 803 flow. Second operand 6 states and 817 transitions. [2023-08-30 02:55:52,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 271 transitions, 2503 flow [2023-08-30 02:55:52,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 271 transitions, 2374 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 02:55:52,792 INFO L231 Difference]: Finished difference. Result has 79 places, 106 transitions, 896 flow [2023-08-30 02:55:52,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=79, PETRI_TRANSITIONS=106} [2023-08-30 02:55:52,793 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-30 02:55:52,793 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 106 transitions, 896 flow [2023-08-30 02:55:52,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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:52,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:52,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:52,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:55:52,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:52,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1339052348, now seen corresponding path program 1 times [2023-08-30 02:55:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759491847] [2023-08-30 02:55:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:53,507 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:53,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759491847] [2023-08-30 02:55:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759491847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:55:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054712519] [2023-08-30 02:55:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:55:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:55:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:55:53,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 283 [2023-08-30 02:55:53,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 106 transitions, 896 flow. Second operand has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:53,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:53,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 283 [2023-08-30 02:55:53,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:55,130 INFO L130 PetriNetUnfolder]: 9259/14508 cut-off events. [2023-08-30 02:55:55,130 INFO L131 PetriNetUnfolder]: For 35766/35766 co-relation queries the response was YES. [2023-08-30 02:55:55,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60781 conditions, 14508 events. 9259/14508 cut-off events. For 35766/35766 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 94789 event pairs, 1083 based on Foata normal form. 9/14517 useless extension candidates. Maximal degree in co-relation 60758. Up to 3674 conditions per place. [2023-08-30 02:55:55,245 INFO L137 encePairwiseOnDemand]: 272/283 looper letters, 159 selfloop transitions, 65 changer transitions 36/260 dead transitions. [2023-08-30 02:55:55,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 260 transitions, 2327 flow [2023-08-30 02:55:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:55:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:55:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1051 transitions. [2023-08-30 02:55:55,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642226148409894 [2023-08-30 02:55:55,249 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1051 transitions. [2023-08-30 02:55:55,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1051 transitions. [2023-08-30 02:55:55,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:55,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1051 transitions. [2023-08-30 02:55:55,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.375) internal successors, (1051), 8 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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:55,254 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:55,254 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:55,255 INFO L175 Difference]: Start difference. First operand has 79 places, 106 transitions, 896 flow. Second operand 8 states and 1051 transitions. [2023-08-30 02:55:55,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 260 transitions, 2327 flow [2023-08-30 02:55:55,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 260 transitions, 2309 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-30 02:55:55,631 INFO L231 Difference]: Finished difference. Result has 91 places, 124 transitions, 1300 flow [2023-08-30 02:55:55,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1300, PETRI_PLACES=91, PETRI_TRANSITIONS=124} [2023-08-30 02:55:55,631 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2023-08-30 02:55:55,631 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 124 transitions, 1300 flow [2023-08-30 02:55:55,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:55,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:55,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:55:55,633 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:55,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash 858414836, now seen corresponding path program 3 times [2023-08-30 02:55:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437116042] [2023-08-30 02:55:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:56,285 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:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:56,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437116042] [2023-08-30 02:55:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437116042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:56,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:55:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009762293] [2023-08-30 02:55:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:56,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:55:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:55:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:55:56,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 283 [2023-08-30 02:55:56,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 124 transitions, 1300 flow. Second operand has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:56,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:56,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 283 [2023-08-30 02:55:56,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:55:58,092 INFO L130 PetriNetUnfolder]: 10644/16889 cut-off events. [2023-08-30 02:55:58,093 INFO L131 PetriNetUnfolder]: For 62226/62226 co-relation queries the response was YES. [2023-08-30 02:55:58,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78112 conditions, 16889 events. 10644/16889 cut-off events. For 62226/62226 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 115655 event pairs, 1485 based on Foata normal form. 9/16898 useless extension candidates. Maximal degree in co-relation 78083. Up to 4804 conditions per place. [2023-08-30 02:55:58,190 INFO L137 encePairwiseOnDemand]: 272/283 looper letters, 180 selfloop transitions, 69 changer transitions 30/279 dead transitions. [2023-08-30 02:55:58,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 279 transitions, 2869 flow [2023-08-30 02:55:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:55:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:55:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1053 transitions. [2023-08-30 02:55:58,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651060070671378 [2023-08-30 02:55:58,193 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1053 transitions. [2023-08-30 02:55:58,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1053 transitions. [2023-08-30 02:55:58,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:55:58,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1053 transitions. [2023-08-30 02:55:58,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.625) internal successors, (1053), 8 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states 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:58,198 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:58,199 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:58,199 INFO L175 Difference]: Start difference. First operand has 91 places, 124 transitions, 1300 flow. Second operand 8 states and 1053 transitions. [2023-08-30 02:55:58,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 279 transitions, 2869 flow [2023-08-30 02:55:58,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 279 transitions, 2860 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 02:55:58,792 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1752 flow [2023-08-30 02:55:58,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1752, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2023-08-30 02:55:58,793 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 50 predicate places. [2023-08-30 02:55:58,793 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1752 flow [2023-08-30 02:55:58,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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:58,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:55:58,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:55:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:55:58,795 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:55:58,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:55:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1102195238, now seen corresponding path program 4 times [2023-08-30 02:55:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:55:58,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565449473] [2023-08-30 02:55:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:55:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:55:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:55:59,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:59,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:55:59,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565449473] [2023-08-30 02:55:59,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565449473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:55:59,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:55:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:55:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774182606] [2023-08-30 02:55:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:55:59,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:55:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:55:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:55:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:55:59,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 283 [2023-08-30 02:55:59,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1752 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:59,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:55:59,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 283 [2023-08-30 02:55:59,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:00,904 INFO L130 PetriNetUnfolder]: 8441/14331 cut-off events. [2023-08-30 02:56:00,905 INFO L131 PetriNetUnfolder]: For 71542/72104 co-relation queries the response was YES. [2023-08-30 02:56:00,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69723 conditions, 14331 events. 8441/14331 cut-off events. For 71542/72104 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 108120 event pairs, 1665 based on Foata normal form. 223/14368 useless extension candidates. Maximal degree in co-relation 69689. Up to 6868 conditions per place. [2023-08-30 02:56:00,982 INFO L137 encePairwiseOnDemand]: 275/283 looper letters, 126 selfloop transitions, 29 changer transitions 79/262 dead transitions. [2023-08-30 02:56:00,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 262 transitions, 2983 flow [2023-08-30 02:56:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 954 transitions. [2023-08-30 02:56:00,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815749621403332 [2023-08-30 02:56:00,984 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 954 transitions. [2023-08-30 02:56:00,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 954 transitions. [2023-08-30 02:56:00,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:00,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 954 transitions. [2023-08-30 02:56:00,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.28571428571428) internal successors, (954), 7 states have internal predecessors, (954), 0 states have call successors, (0), 0 states 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:56:00,989 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:56:00,990 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:56:00,990 INFO L175 Difference]: Start difference. First operand has 102 places, 141 transitions, 1752 flow. Second operand 7 states and 954 transitions. [2023-08-30 02:56:00,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 262 transitions, 2983 flow [2023-08-30 02:56:01,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 262 transitions, 2933 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:01,527 INFO L231 Difference]: Finished difference. Result has 110 places, 139 transitions, 1754 flow [2023-08-30 02:56:01,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1708, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1754, PETRI_PLACES=110, PETRI_TRANSITIONS=139} [2023-08-30 02:56:01,528 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2023-08-30 02:56:01,528 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 139 transitions, 1754 flow [2023-08-30 02:56:01,528 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:56:01,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:01,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:01,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:56:01,528 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:01,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash -355836238, now seen corresponding path program 5 times [2023-08-30 02:56:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883702559] [2023-08-30 02:56:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:01,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:01,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883702559] [2023-08-30 02:56:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883702559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:56:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57766194] [2023-08-30 02:56:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:01,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:01,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 283 [2023-08-30 02:56:01,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 139 transitions, 1754 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:56:01,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:01,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 283 [2023-08-30 02:56:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:03,176 INFO L130 PetriNetUnfolder]: 6495/10805 cut-off events. [2023-08-30 02:56:03,177 INFO L131 PetriNetUnfolder]: For 69070/69731 co-relation queries the response was YES. [2023-08-30 02:56:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55615 conditions, 10805 events. 6495/10805 cut-off events. For 69070/69731 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 78388 event pairs, 581 based on Foata normal form. 445/11071 useless extension candidates. Maximal degree in co-relation 55578. Up to 4091 conditions per place. [2023-08-30 02:56:03,260 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 182 selfloop transitions, 18 changer transitions 82/300 dead transitions. [2023-08-30 02:56:03,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 300 transitions, 4025 flow [2023-08-30 02:56:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-30 02:56:03,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47400302877334677 [2023-08-30 02:56:03,262 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-30 02:56:03,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-30 02:56:03,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:03,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-30 02:56:03,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:03,267 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:56:03,267 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:56:03,268 INFO L175 Difference]: Start difference. First operand has 110 places, 139 transitions, 1754 flow. Second operand 7 states and 939 transitions. [2023-08-30 02:56:03,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 300 transitions, 4025 flow [2023-08-30 02:56:03,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 300 transitions, 3823 flow, removed 28 selfloop flow, removed 7 redundant places. [2023-08-30 02:56:03,922 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 1252 flow [2023-08-30 02:56:03,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1252, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2023-08-30 02:56:03,922 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-30 02:56:03,923 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 1252 flow [2023-08-30 02:56:03,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:56:03,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:03,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:03,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:56:03,925 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:03,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash -65715015, now seen corresponding path program 1 times [2023-08-30 02:56:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368918394] [2023-08-30 02:56:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:04,377 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:56:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:04,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368918394] [2023-08-30 02:56:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368918394] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:04,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597653004] [2023-08-30 02:56:04,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:04,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:56:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:04,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:56:04,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:56:04,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 283 [2023-08-30 02:56:04,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 1252 flow. Second operand has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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:56:04,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:04,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 283 [2023-08-30 02:56:04,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:05,156 INFO L130 PetriNetUnfolder]: 2942/4604 cut-off events. [2023-08-30 02:56:05,157 INFO L131 PetriNetUnfolder]: For 25627/25627 co-relation queries the response was YES. [2023-08-30 02:56:05,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24748 conditions, 4604 events. 2942/4604 cut-off events. For 25627/25627 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 24282 event pairs, 193 based on Foata normal form. 1/4605 useless extension candidates. Maximal degree in co-relation 24714. Up to 1936 conditions per place. [2023-08-30 02:56:05,176 INFO L137 encePairwiseOnDemand]: 270/283 looper letters, 98 selfloop transitions, 26 changer transitions 133/257 dead transitions. [2023-08-30 02:56:05,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 257 transitions, 3038 flow [2023-08-30 02:56:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:56:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:56:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1412 transitions. [2023-08-30 02:56:05,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4535817539351108 [2023-08-30 02:56:05,179 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1412 transitions. [2023-08-30 02:56:05,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1412 transitions. [2023-08-30 02:56:05,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:05,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1412 transitions. [2023-08-30 02:56:05,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.36363636363637) internal successors, (1412), 11 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states 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:56:05,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states 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:56:05,185 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states 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:56:05,185 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 1252 flow. Second operand 11 states and 1412 transitions. [2023-08-30 02:56:05,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 257 transitions, 3038 flow [2023-08-30 02:56:05,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 257 transitions, 2785 flow, removed 36 selfloop flow, removed 9 redundant places. [2023-08-30 02:56:05,263 INFO L231 Difference]: Finished difference. Result has 112 places, 80 transitions, 849 flow [2023-08-30 02:56:05,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=849, PETRI_PLACES=112, PETRI_TRANSITIONS=80} [2023-08-30 02:56:05,264 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 60 predicate places. [2023-08-30 02:56:05,264 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 80 transitions, 849 flow [2023-08-30 02:56:05,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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:56:05,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:05,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:05,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:56:05,265 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:05,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1015192597, now seen corresponding path program 2 times [2023-08-30 02:56:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569292290] [2023-08-30 02:56:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:06,277 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:56:06,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:56:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569292290] [2023-08-30 02:56:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569292290] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:06,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:56:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056351364] [2023-08-30 02:56:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:06,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:56:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:56:06,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:56:06,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:56:06,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-30 02:56:06,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 80 transitions, 849 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:56:06,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:06,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-30 02:56:06,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:06,709 INFO L130 PetriNetUnfolder]: 753/1300 cut-off events. [2023-08-30 02:56:06,709 INFO L131 PetriNetUnfolder]: For 6141/6164 co-relation queries the response was YES. [2023-08-30 02:56:06,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6547 conditions, 1300 events. 753/1300 cut-off events. For 6141/6164 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5867 event pairs, 156 based on Foata normal form. 3/1287 useless extension candidates. Maximal degree in co-relation 6515. Up to 600 conditions per place. [2023-08-30 02:56:06,716 INFO L137 encePairwiseOnDemand]: 277/283 looper letters, 87 selfloop transitions, 10 changer transitions 44/147 dead transitions. [2023-08-30 02:56:06,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 147 transitions, 1545 flow [2023-08-30 02:56:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:56:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:56:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-08-30 02:56:06,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829210836277974 [2023-08-30 02:56:06,717 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-08-30 02:56:06,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-08-30 02:56:06,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:06,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-08-30 02:56:06,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:06,721 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:56:06,721 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:56:06,721 INFO L175 Difference]: Start difference. First operand has 112 places, 80 transitions, 849 flow. Second operand 6 states and 820 transitions. [2023-08-30 02:56:06,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 147 transitions, 1545 flow [2023-08-30 02:56:06,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 147 transitions, 1223 flow, removed 32 selfloop flow, removed 25 redundant places. [2023-08-30 02:56:06,737 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 523 flow [2023-08-30 02:56:06,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2023-08-30 02:56:06,737 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2023-08-30 02:56:06,738 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 523 flow [2023-08-30 02:56:06,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:56:06,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:06,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:56:06,738 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:06,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash 861612901, now seen corresponding path program 3 times [2023-08-30 02:56:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:56:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63527807] [2023-08-30 02:56:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:56:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:56:06,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:56:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:56:06,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:56:06,920 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:56:06,921 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:56:06,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:56:06,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:56:06,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:56:06,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:56:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:56:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:56:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:56:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:56:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:56:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:56:06,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:56:06,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:56:06,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:56:06,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:56:06,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:56:06,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:56:06,929 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:06,934 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:56:06,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:56:07,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:56:07 BasicIcfg [2023-08-30 02:56:07,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:56:07,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:56:07,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:56:07,037 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:56:07,038 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:23" (3/4) ... [2023-08-30 02:56:07,040 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:56:07,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:56:07,041 INFO L158 Benchmark]: Toolchain (without parser) took 45183.31ms. Allocated memory was 77.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 54.0MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 02:56:07,041 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:56:07,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.85ms. Allocated memory is still 77.6MB. Free memory was 53.8MB in the beginning and 49.5MB in the end (delta: 4.2MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-08-30 02:56:07,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.40ms. Allocated memory is still 77.6MB. Free memory was 49.5MB in the beginning and 46.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:56:07,042 INFO L158 Benchmark]: Boogie Preprocessor took 44.64ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 44.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:56:07,042 INFO L158 Benchmark]: RCFGBuilder took 785.35ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.7MB in the beginning and 70.5MB in the end (delta: -25.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 02:56:07,043 INFO L158 Benchmark]: TraceAbstraction took 43775.60ms. Allocated memory was 94.4MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 69.9MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 02:56:07,043 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 3.6GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:56:07,045 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.22ms. Allocated memory is still 60.8MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.85ms. Allocated memory is still 77.6MB. Free memory was 53.8MB in the beginning and 49.5MB in the end (delta: 4.2MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.40ms. Allocated memory is still 77.6MB. Free memory was 49.5MB in the beginning and 46.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.64ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 44.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 785.35ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.7MB in the beginning and 70.5MB in the end (delta: -25.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 43775.60ms. Allocated memory was 94.4MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 69.9MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 3.6GB. Free memory is still 2.5GB. 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.8s, 152 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 138 TotalNumberOfCompositions, 10048 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4423, independent: 4185, independent conditional: 0, independent unconditional: 4185, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1916, independent: 1859, independent conditional: 0, independent unconditional: 1859, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4423, independent: 2326, independent conditional: 0, independent unconditional: 2326, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1916, unknown conditional: 0, unknown unconditional: 1916] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 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: 43.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1682 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1472 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 552 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3853 IncrementalHoareTripleChecker+Invalid, 4075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 96 mSDtfsCounter, 3853 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1754occurred in iteration=15, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 4313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:56:07,084 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/mix043.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --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:56:09,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:56:09,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:56:09,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:56:09,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:56:09,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:56:09,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:56:09,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:56:09,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:56:09,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:56:09,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:56:09,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:56:09,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:56:09,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:56:09,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:56:09,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:56:09,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:56:09,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:56:09,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:56:09,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:56:09,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:56:09,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:56:09,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:56:09,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:56:09,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:56:09,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:56:09,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:56:09,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:56:09,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:56:09,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:56:09,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:56:09,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:56:09,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:56:09,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:56:09,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:56:09,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:56:09,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:56:09,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:56:09,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:56:09,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:56:09,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:56:09,388 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:56:09,421 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:56:09,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:56:09,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:56:09,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:56:09,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:56:09,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:56:09,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:56:09,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:56:09,424 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:56:09,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:56:09,425 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:56:09,426 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:56:09,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:56:09,427 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:56:09,427 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:56:09,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:56:09,427 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:56:09,427 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:56:09,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:56:09,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:56:09,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:56:09,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:56:09,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:56:09,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:56:09,429 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:56:09,429 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:56:09,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:56:09,429 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:56:09,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:56:09,429 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:56:09,430 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:56:09,430 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 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:56:09,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:56:09,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:56:09,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:56:09,766 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:56:09,767 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:56:09,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-30 02:56:11,024 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:56:11,255 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:56:11,256 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-30 02:56:11,277 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d4b4dc5/77b373b76f18499bace9499d241852c0/FLAGaf675efbf [2023-08-30 02:56:11,303 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d4b4dc5/77b373b76f18499bace9499d241852c0 [2023-08-30 02:56:11,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:56:11,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:56:11,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:56:11,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:56:11,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:56:11,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2354f153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11, skipping insertion in model container [2023-08-30 02:56:11,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:56:11,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:56:11,556 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/mix043.oepc.i[945,958] [2023-08-30 02:56:11,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:56:11,774 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:56:11,789 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/mix043.oepc.i[945,958] [2023-08-30 02:56:11,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:56:11,898 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:56:11,898 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:56:11,904 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:56:11,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11 WrapperNode [2023-08-30 02:56:11,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:56:11,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:56:11,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:56:11,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:56:11,912 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:56:11" (1/1) ... [2023-08-30 02:56:11,931 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:56:11" (1/1) ... [2023-08-30 02:56:11,954 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-30 02:56:11,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:56:11,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:56:11,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:56:11,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:56:11,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,989 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:11,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:56:12,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:56:12,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:56:12,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:56:12,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (1/1) ... [2023-08-30 02:56:12,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:56:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:56:12,042 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:56:12,069 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:56:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:56:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:56:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:56:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:56:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:56:12,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:56:12,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:56:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:56:12,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:56:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:56:12,085 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:56:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:56:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:56:12,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:56:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:56:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:56:12,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:56:12,088 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:56:12,297 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:56:12,299 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:56:12,675 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:56:12,796 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:56:12,797 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:56:12,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:12 BoogieIcfgContainer [2023-08-30 02:56:12,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:56:12,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:56:12,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:56:12,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:56:12,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:56:11" (1/3) ... [2023-08-30 02:56:12,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d81582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:56:12, skipping insertion in model container [2023-08-30 02:56:12,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:56:11" (2/3) ... [2023-08-30 02:56:12,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d81582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:56:12, skipping insertion in model container [2023-08-30 02:56:12,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:12" (3/3) ... [2023-08-30 02:56:12,807 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-08-30 02:56:12,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:56:12,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:56:12,824 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:56:12,910 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:56:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 02:56:13,016 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 02:56:13,017 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:13,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:56:13,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-30 02:56:13,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-30 02:56:13,033 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:56:13,040 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 02:56:13,043 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-30 02:56:13,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-30 02:56:13,076 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-30 02:56:13,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:13,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-30 02:56:13,082 INFO L119 LiptonReduction]: Number of co-enabled transitions 3636 [2023-08-30 02:56:19,746 INFO L134 LiptonReduction]: Checked pairs total: 9249 [2023-08-30 02:56:19,747 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-30 02:56:19,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:56:19,764 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;@5cb30820, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:56:19,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:56:19,766 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:56:19,766 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:19,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:19,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:56:19,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:19,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2023-08-30 02:56:19,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:19,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778761763] [2023-08-30 02:56:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:19,782 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:56:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:19,793 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:56:19,798 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:56:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:56:19,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:19,883 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:56:19,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:19,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:19,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778761763] [2023-08-30 02:56:19,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778761763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:19,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:56:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114201783] [2023-08-30 02:56:19,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:19,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:56:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:19,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:56:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:56:19,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 281 [2023-08-30 02:56:19,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 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:56:19,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:19,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 281 [2023-08-30 02:56:19,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:21,242 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2023-08-30 02:56:21,243 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-30 02:56:21,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 52492 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2023-08-30 02:56:21,343 INFO L137 encePairwiseOnDemand]: 273/281 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-30 02:56:21,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-30 02:56:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:56:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:56:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-30 02:56:21,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284697508896797 [2023-08-30 02:56:21,356 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-30 02:56:21,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-30 02:56:21,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:21,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-30 02:56:21,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:56:21,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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:56:21,366 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states 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:56:21,368 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 297 transitions. [2023-08-30 02:56:21,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-30 02:56:21,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:21,373 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-30 02:56:21,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-30 02:56:21,378 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-30 02:56:21,378 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-30 02:56:21,379 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:56:21,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:21,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:56:21,390 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:56:21,587 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:56:21,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:21,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash 604401, now seen corresponding path program 1 times [2023-08-30 02:56:21,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526345566] [2023-08-30 02:56:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:21,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:56:21,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:21,591 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:56:21,594 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:56:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:21,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:56:21,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:21,683 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:56:21,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:21,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526345566] [2023-08-30 02:56:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526345566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:56:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963624220] [2023-08-30 02:56:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:21,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:56:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:56:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:56:21,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-30 02:56:21,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:21,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:21,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-30 02:56:21,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:22,653 INFO L130 PetriNetUnfolder]: 5879/8510 cut-off events. [2023-08-30 02:56:22,654 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:56:22,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16651 conditions, 8510 events. 5879/8510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51046 event pairs, 1079 based on Foata normal form. 0/7854 useless extension candidates. Maximal degree in co-relation 16648. Up to 6367 conditions per place. [2023-08-30 02:56:22,710 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-30 02:56:22,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-30 02:56:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:56:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:56:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-30 02:56:22,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195729537366548 [2023-08-30 02:56:22,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-30 02:56:22,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-30 02:56:22,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:22,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-30 02:56:22,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:56:22,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:56:22,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:56:22,723 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 438 transitions. [2023-08-30 02:56:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-30 02:56:22,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:56:22,725 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-30 02:56:22,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 02:56:22,726 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-30 02:56:22,726 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-30 02:56:22,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:22,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:22,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:22,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:56:22,936 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:56:22,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:22,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1634148415, now seen corresponding path program 1 times [2023-08-30 02:56:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:22,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289682902] [2023-08-30 02:56:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:22,938 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:56:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:22,940 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:56:22,943 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:56:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:23,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:56:23,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:23,073 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:56:23,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:23,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:23,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289682902] [2023-08-30 02:56:23,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289682902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:23,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:23,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:56:23,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044619037] [2023-08-30 02:56:23,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:23,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:56:23,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:56:23,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:56:23,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-30 02:56:23,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:56:23,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:23,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-30 02:56:23,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:23,794 INFO L130 PetriNetUnfolder]: 3939/5649 cut-off events. [2023-08-30 02:56:23,795 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-30 02:56:23,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 5649 events. 3939/5649 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30531 event pairs, 655 based on Foata normal form. 320/5714 useless extension candidates. Maximal degree in co-relation 11794. Up to 3025 conditions per place. [2023-08-30 02:56:23,819 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 51 selfloop transitions, 6 changer transitions 1/62 dead transitions. [2023-08-30 02:56:23,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 262 flow [2023-08-30 02:56:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:56:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:56:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-30 02:56:23,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49466192170818507 [2023-08-30 02:56:23,822 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-30 02:56:23,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-30 02:56:23,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:23,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-30 02:56:23,824 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:56:23,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:56:23,826 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:56:23,826 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 556 transitions. [2023-08-30 02:56:23,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 262 flow [2023-08-30 02:56:23,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:23,828 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 108 flow [2023-08-30 02:56:23,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-30 02:56:23,829 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-30 02:56:23,829 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 108 flow [2023-08-30 02:56:23,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:56:23,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:23,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:23,839 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:56:24,039 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:56:24,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:24,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 791621518, now seen corresponding path program 1 times [2023-08-30 02:56:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773667833] [2023-08-30 02:56:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:24,041 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:56:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:24,042 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:56:24,046 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:56:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:24,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:56:24,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:24,199 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:56:24,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:24,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:24,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773667833] [2023-08-30 02:56:24,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773667833] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:24,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:24,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:56:24,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909108144] [2023-08-30 02:56:24,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:24,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:56:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:56:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:56:24,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-30 02:56:24,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:56:24,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:24,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-30 02:56:24,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:24,729 INFO L130 PetriNetUnfolder]: 2022/3083 cut-off events. [2023-08-30 02:56:24,730 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2023-08-30 02:56:24,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 3083 events. 2022/3083 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16180 event pairs, 328 based on Foata normal form. 212/3202 useless extension candidates. Maximal degree in co-relation 7825. Up to 1044 conditions per place. [2023-08-30 02:56:24,745 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 64 selfloop transitions, 10 changer transitions 1/79 dead transitions. [2023-08-30 02:56:24,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 379 flow [2023-08-30 02:56:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:56:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:56:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-30 02:56:24,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49608540925266903 [2023-08-30 02:56:24,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-30 02:56:24,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-30 02:56:24,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:24,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-30 02:56:24,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:24,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:56:24,753 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states 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:56:24,754 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 108 flow. Second operand 5 states and 697 transitions. [2023-08-30 02:56:24,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 379 flow [2023-08-30 02:56:24,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:24,761 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 160 flow [2023-08-30 02:56:24,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-30 02:56:24,763 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-30 02:56:24,763 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 160 flow [2023-08-30 02:56:24,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:56:24,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:24,764 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:56:24,773 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:56:24,973 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:56:24,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:24,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -914658613, now seen corresponding path program 1 times [2023-08-30 02:56:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359888817] [2023-08-30 02:56:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:24,974 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:56:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:24,976 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:56:24,979 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:56:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:25,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:56:25,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:25,134 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:56:25,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:25,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359888817] [2023-08-30 02:56:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359888817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:25,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165073156] [2023-08-30 02:56:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:56:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:25,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:56:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:56:25,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-30 02:56:25,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 160 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:56:25,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:25,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-30 02:56:25,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:25,556 INFO L130 PetriNetUnfolder]: 1176/1850 cut-off events. [2023-08-30 02:56:25,556 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2023-08-30 02:56:25,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5346 conditions, 1850 events. 1176/1850 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9136 event pairs, 326 based on Foata normal form. 77/1897 useless extension candidates. Maximal degree in co-relation 5339. Up to 630 conditions per place. [2023-08-30 02:56:25,566 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 75 selfloop transitions, 14 changer transitions 1/94 dead transitions. [2023-08-30 02:56:25,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 502 flow [2023-08-30 02:56:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:56:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:56:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-30 02:56:25,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958481613285884 [2023-08-30 02:56:25,570 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-30 02:56:25,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-30 02:56:25,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:25,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-30 02:56:25,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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:56:25,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:56:25,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:56:25,577 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 160 flow. Second operand 6 states and 836 transitions. [2023-08-30 02:56:25,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 502 flow [2023-08-30 02:56:25,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 472 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:25,590 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 210 flow [2023-08-30 02:56:25,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 02:56:25,592 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-30 02:56:25,592 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 210 flow [2023-08-30 02:56:25,596 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:56:25,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:25,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:25,609 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:56:25,806 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:56:25,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:25,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash -61646761, now seen corresponding path program 1 times [2023-08-30 02:56:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483538231] [2023-08-30 02:56:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:25,808 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:56:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:25,809 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:56:25,811 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:56:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:25,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:56:25,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:26,002 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:56:26,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:26,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483538231] [2023-08-30 02:56:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483538231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:26,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:56:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212581357] [2023-08-30 02:56:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:26,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:26,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-30 02:56:26,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:56:26,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:26,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-30 02:56:26,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:26,506 INFO L130 PetriNetUnfolder]: 1011/1570 cut-off events. [2023-08-30 02:56:26,506 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-30 02:56:26,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 1570 events. 1011/1570 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7534 event pairs, 326 based on Foata normal form. 14/1567 useless extension candidates. Maximal degree in co-relation 4603. Up to 630 conditions per place. [2023-08-30 02:56:26,514 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 58 selfloop transitions, 18 changer transitions 1/81 dead transitions. [2023-08-30 02:56:26,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 460 flow [2023-08-30 02:56:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-30 02:56:26,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4814438230808338 [2023-08-30 02:56:26,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-30 02:56:26,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-30 02:56:26,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:26,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-30 02:56:26,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:56:26,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:56:26,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:56:26,523 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 210 flow. Second operand 7 states and 947 transitions. [2023-08-30 02:56:26,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 460 flow [2023-08-30 02:56:26,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 414 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-30 02:56:26,536 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 220 flow [2023-08-30 02:56:26,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-30 02:56:26,538 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-30 02:56:26,538 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 220 flow [2023-08-30 02:56:26,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:56:26,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:26,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:26,549 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:56:26,749 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:56:26,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:26,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 466172065, now seen corresponding path program 1 times [2023-08-30 02:56:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920980217] [2023-08-30 02:56:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:26,750 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:56:26,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:26,751 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:56:26,752 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:56:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:26,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:56:26,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:27,548 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:56:27,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:27,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:27,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920980217] [2023-08-30 02:56:27,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920980217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:27,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:27,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:56:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175091239] [2023-08-30 02:56:27,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:27,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:56:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:56:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:56:27,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 281 [2023-08-30 02:56:27,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:27,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:27,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 281 [2023-08-30 02:56:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:28,377 INFO L130 PetriNetUnfolder]: 999/1543 cut-off events. [2023-08-30 02:56:28,377 INFO L131 PetriNetUnfolder]: For 1611/1611 co-relation queries the response was YES. [2023-08-30 02:56:28,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4484 conditions, 1543 events. 999/1543 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7162 event pairs, 151 based on Foata normal form. 0/1543 useless extension candidates. Maximal degree in co-relation 4475. Up to 1251 conditions per place. [2023-08-30 02:56:28,386 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 58 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-30 02:56:28,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 478 flow [2023-08-30 02:56:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:56:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:56:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-30 02:56:28,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42052194543297744 [2023-08-30 02:56:28,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-30 02:56:28,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-30 02:56:28,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:28,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-30 02:56:28,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:56:28,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:56:28,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states 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:56:28,395 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 220 flow. Second operand 6 states and 709 transitions. [2023-08-30 02:56:28,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 478 flow [2023-08-30 02:56:28,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 324 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-30 02:56:28,404 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 128 flow [2023-08-30 02:56:28,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-30 02:56:28,405 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-30 02:56:28,405 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 128 flow [2023-08-30 02:56:28,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:28,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:28,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:28,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:56:28,617 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:56:28,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:28,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1405210741, now seen corresponding path program 1 times [2023-08-30 02:56:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584739322] [2023-08-30 02:56:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:56:28,620 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:56:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:28,621 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:56:28,624 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:56:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:56:28,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 02:56:28,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:29,037 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:56:29,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:29,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584739322] [2023-08-30 02:56:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584739322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:56:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693232203] [2023-08-30 02:56:29,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:29,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:56:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:56:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:56:29,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-30 02:56:29,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:56:29,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:29,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-30 02:56:29,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:29,664 INFO L130 PetriNetUnfolder]: 1527/2405 cut-off events. [2023-08-30 02:56:29,665 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2023-08-30 02:56:29,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5812 conditions, 2405 events. 1527/2405 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12425 event pairs, 293 based on Foata normal form. 1/2402 useless extension candidates. Maximal degree in co-relation 5808. Up to 836 conditions per place. [2023-08-30 02:56:29,675 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 83 selfloop transitions, 6 changer transitions 45/138 dead transitions. [2023-08-30 02:56:29,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 138 transitions, 728 flow [2023-08-30 02:56:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2023-08-30 02:56:29,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860193187595323 [2023-08-30 02:56:29,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2023-08-30 02:56:29,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2023-08-30 02:56:29,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:29,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2023-08-30 02:56:29,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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:56:29,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:56:29,687 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:56:29,687 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 128 flow. Second operand 7 states and 956 transitions. [2023-08-30 02:56:29,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 138 transitions, 728 flow [2023-08-30 02:56:29,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 138 transitions, 711 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:56:29,690 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 159 flow [2023-08-30 02:56:29,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-30 02:56:29,691 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-30 02:56:29,691 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 159 flow [2023-08-30 02:56:29,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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:56:29,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:29,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:29,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-30 02:56:29,902 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:56:29,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:29,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash 396946239, now seen corresponding path program 2 times [2023-08-30 02:56:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887167401] [2023-08-30 02:56:29,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:56:29,904 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:56:29,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:29,906 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:56:29,909 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:56:30,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:56:30,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:56:30,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:56:30,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:30,078 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:56:30,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:30,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887167401] [2023-08-30 02:56:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887167401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:56:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479565564] [2023-08-30 02:56:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:30,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:56:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:56:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:56:30,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-30 02:56:30,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:56:30,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:30,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-30 02:56:30,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:30,614 INFO L130 PetriNetUnfolder]: 2367/3838 cut-off events. [2023-08-30 02:56:30,615 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2023-08-30 02:56:30,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 3838 events. 2367/3838 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22942 event pairs, 250 based on Foata normal form. 1/3834 useless extension candidates. Maximal degree in co-relation 10180. Up to 1886 conditions per place. [2023-08-30 02:56:30,634 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 61 selfloop transitions, 1 changer transitions 35/100 dead transitions. [2023-08-30 02:56:30,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 100 transitions, 563 flow [2023-08-30 02:56:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:56:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:56:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-30 02:56:30,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50355871886121 [2023-08-30 02:56:30,637 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-30 02:56:30,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-30 02:56:30,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:30,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-30 02:56:30,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:56:30,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:56:30,641 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:56:30,641 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 159 flow. Second operand 4 states and 566 transitions. [2023-08-30 02:56:30,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 100 transitions, 563 flow [2023-08-30 02:56:30,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 556 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:56:30,645 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 161 flow [2023-08-30 02:56:30,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-30 02:56:30,646 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-30 02:56:30,646 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 161 flow [2023-08-30 02:56:30,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:56:30,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:30,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:30,668 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:56:30,857 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:56:30,857 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:30,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1170313985, now seen corresponding path program 3 times [2023-08-30 02:56:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264824543] [2023-08-30 02:56:30,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:56:30,858 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:56:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:30,860 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:56:30,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:56:30,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:56:30,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:56:30,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:56:31,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:31,040 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:56:31,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:31,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264824543] [2023-08-30 02:56:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264824543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:31,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:56:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190033942] [2023-08-30 02:56:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:56:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:56:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:56:31,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-08-30 02:56:31,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:56:31,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:31,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-08-30 02:56:31,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:31,578 INFO L130 PetriNetUnfolder]: 2486/4044 cut-off events. [2023-08-30 02:56:31,578 INFO L131 PetriNetUnfolder]: For 2724/2725 co-relation queries the response was YES. [2023-08-30 02:56:31,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11070 conditions, 4044 events. 2486/4044 cut-off events. For 2724/2725 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 24061 event pairs, 354 based on Foata normal form. 1/4008 useless extension candidates. Maximal degree in co-relation 11062. Up to 1881 conditions per place. [2023-08-30 02:56:31,590 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 54 selfloop transitions, 1 changer transitions 35/93 dead transitions. [2023-08-30 02:56:31,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 93 transitions, 526 flow [2023-08-30 02:56:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:56:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:56:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-30 02:56:31,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:56:31,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-30 02:56:31,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-30 02:56:31,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:31,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-30 02:56:31,596 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:56:31,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:56:31,598 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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:56:31,598 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 161 flow. Second operand 4 states and 562 transitions. [2023-08-30 02:56:31,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 93 transitions, 526 flow [2023-08-30 02:56:31,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 522 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:31,603 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 156 flow [2023-08-30 02:56:31,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-30 02:56:31,604 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-30 02:56:31,604 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 156 flow [2023-08-30 02:56:31,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:56:31,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:31,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:31,615 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:56:31,814 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:56:31,815 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:31,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:31,815 INFO L85 PathProgramCache]: Analyzing trace with hash 594991745, now seen corresponding path program 4 times [2023-08-30 02:56:31,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392257322] [2023-08-30 02:56:31,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:56:31,819 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:56:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:31,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:56:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 02:56:31,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:56:31,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:56:31,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:56:31,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:56:31,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:31,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392257322] [2023-08-30 02:56:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392257322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:31,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:56:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461966504] [2023-08-30 02:56:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:31,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:56:31,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:56:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:56:31,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-08-30 02:56:31,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:56:31,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:31,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-08-30 02:56:31,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:32,306 INFO L130 PetriNetUnfolder]: 1823/2962 cut-off events. [2023-08-30 02:56:32,306 INFO L131 PetriNetUnfolder]: For 2079/2084 co-relation queries the response was YES. [2023-08-30 02:56:32,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8371 conditions, 2962 events. 1823/2962 cut-off events. For 2079/2084 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16212 event pairs, 719 based on Foata normal form. 1/2873 useless extension candidates. Maximal degree in co-relation 8362. Up to 1605 conditions per place. [2023-08-30 02:56:32,314 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 53 selfloop transitions, 2 changer transitions 14/72 dead transitions. [2023-08-30 02:56:32,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 409 flow [2023-08-30 02:56:32,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:56:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:56:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-30 02:56:32,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505338078291815 [2023-08-30 02:56:32,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-30 02:56:32,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-30 02:56:32,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:32,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-30 02:56:32,318 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:56:32,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:56:32,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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:56:32,320 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 156 flow. Second operand 3 states and 426 transitions. [2023-08-30 02:56:32,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 409 flow [2023-08-30 02:56:32,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 395 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 02:56:32,323 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 155 flow [2023-08-30 02:56:32,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-30 02:56:32,324 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-30 02:56:32,324 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 155 flow [2023-08-30 02:56:32,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:56:32,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:32,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:32,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:56:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:56:32,535 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:32,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -228679689, now seen corresponding path program 5 times [2023-08-30 02:56:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824307748] [2023-08-30 02:56:32,536 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:56:32,536 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:56:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:32,537 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:56:32,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 02:56:32,659 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:56:32,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:56:32,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 02:56:32,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:56:33,047 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:56:33,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:56:33,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:56:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824307748] [2023-08-30 02:56:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824307748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:56:33,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:56:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:56:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28405621] [2023-08-30 02:56:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:56:33,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 02:56:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:56:33,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 02:56:33,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 02:56:33,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-30 02:56:33,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:56:33,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:56:33,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-30 02:56:33,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:56:33,507 INFO L130 PetriNetUnfolder]: 983/1628 cut-off events. [2023-08-30 02:56:33,507 INFO L131 PetriNetUnfolder]: For 863/895 co-relation queries the response was YES. [2023-08-30 02:56:33,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4747 conditions, 1628 events. 983/1628 cut-off events. For 863/895 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7893 event pairs, 203 based on Foata normal form. 25/1624 useless extension candidates. Maximal degree in co-relation 4738. Up to 767 conditions per place. [2023-08-30 02:56:33,515 INFO L137 encePairwiseOnDemand]: 275/281 looper letters, 50 selfloop transitions, 5 changer transitions 41/100 dead transitions. [2023-08-30 02:56:33,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 100 transitions, 553 flow [2023-08-30 02:56:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:56:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:56:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-30 02:56:33,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47737671581087954 [2023-08-30 02:56:33,519 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-30 02:56:33,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-30 02:56:33,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:56:33,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-30 02:56:33,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:56:33,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:56:33,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states 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:56:33,525 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 155 flow. Second operand 7 states and 939 transitions. [2023-08-30 02:56:33,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 100 transitions, 553 flow [2023-08-30 02:56:33,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 543 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:56:33,528 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 166 flow [2023-08-30 02:56:33,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-30 02:56:33,529 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-30 02:56:33,529 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 166 flow [2023-08-30 02:56:33,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states 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:56:33,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:56:33,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:33,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:56:33,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:56:33,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:56:33,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:56:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1017579291, now seen corresponding path program 6 times [2023-08-30 02:56:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:56:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599790816] [2023-08-30 02:56:33,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 02:56:33,741 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:56:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:56:33,743 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:56:33,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-30 02:56:33,874 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 02:56:33,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:56:33,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:56:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:56:34,012 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:56:34,013 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:56:34,014 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:56:34,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:56:34,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:56:34,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:56:34,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:56:34,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:56:34,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:56:34,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:56:34,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:56:34,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:56:34,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:56:34,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:56:34,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:56:34,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:56:34,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:56:34,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:56:34,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-30 02:56:34,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:56:34,229 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:56:34,234 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:56:34,234 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:56:34,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:56:34 BasicIcfg [2023-08-30 02:56:34,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:56:34,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:56:34,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:56:34,332 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:56:34,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:56:12" (3/4) ... [2023-08-30 02:56:34,366 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:56:34,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:56:34,367 INFO L158 Benchmark]: Toolchain (without parser) took 23059.20ms. Allocated memory was 65.0MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 30.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 508.3MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,367 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:56:34,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.76ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 30.3MB in the beginning and 48.0MB in the end (delta: -17.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.65ms. Allocated memory is still 88.1MB. Free memory was 48.0MB in the beginning and 45.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,367 INFO L158 Benchmark]: Boogie Preprocessor took 44.93ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 66.5MB in the end (delta: -21.1MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,368 INFO L158 Benchmark]: RCFGBuilder took 797.88ms. Allocated memory is still 88.1MB. Free memory was 66.5MB in the beginning and 45.7MB in the end (delta: 20.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,368 INFO L158 Benchmark]: TraceAbstraction took 21530.39ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 44.8MB in the beginning and 906.6MB in the end (delta: -861.8MB). Peak memory consumption was 499.0MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,368 INFO L158 Benchmark]: Witness Printer took 34.61ms. Allocated memory is still 1.4GB. Free memory was 906.6MB in the beginning and 1.3GB in the end (delta: -426.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:56:34,369 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 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.76ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 30.3MB in the beginning and 48.0MB in the end (delta: -17.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.65ms. Allocated memory is still 88.1MB. Free memory was 48.0MB in the beginning and 45.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.93ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 66.5MB in the end (delta: -21.1MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * RCFGBuilder took 797.88ms. Allocated memory is still 88.1MB. Free memory was 66.5MB in the beginning and 45.7MB in the end (delta: 20.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21530.39ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 44.8MB in the beginning and 906.6MB in the end (delta: -861.8MB). Peak memory consumption was 499.0MB. Max. memory is 16.1GB. * Witness Printer took 34.61ms. Allocated memory is still 1.4GB. Free memory was 906.6MB in the beginning and 1.3GB in the end (delta: -426.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 153 PlacesBefore, 52 PlacesAfterwards, 142 TransitionsBefore, 39 TransitionsAfterwards, 3636 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 9249 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4023, independent: 3819, independent conditional: 0, independent unconditional: 3819, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1934, independent: 1870, independent conditional: 0, independent unconditional: 1870, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4023, independent: 1949, independent conditional: 0, independent unconditional: 1949, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1934, unknown conditional: 0, unknown unconditional: 1934] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_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 b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=0, t1129={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=1, t1129={11:0}, t1130={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=2, t1129={11:0}, t1130={15:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=3, t1129={11:0}, t1130={15:0}, t1131={7:0}, t1132={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={11:0}, t1130={15:0}, t1131={7:0}, t1132={-2147483637:0}, weak$$choice2=0, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={11:0}, t1130={15:0}, t1131={7:0}, t1132={-2147483637:0}, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 761 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2071 IncrementalHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 25 mSDtfsCounter, 2071 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 228 ConstructedInterpolants, 15 QuantifiedInterpolants, 2226 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1941 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:56:34,437 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