./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/safe012_power.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 c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:34:13,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:34:13,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:34:13,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:34:13,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:34:13,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:34:13,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:34:13,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:34:13,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:34:13,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:34:13,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:34:13,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:34:13,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:34:13,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:34:13,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:34:13,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:34:13,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:34:13,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:34:13,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:34:13,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:34:13,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:34:13,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:34:13,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:34:13,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:34:13,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:34:13,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:34:13,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:34:13,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:34:13,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:34:13,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:34:13,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:34:13,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:34:13,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:34:13,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:34:13,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:34:13,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:34:13,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:34:13,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:34:13,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:34:13,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:34:13,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:34:13,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:34:13,919 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:34:13,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:34:13,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:34:13,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:34:13,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:34:13,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:34:13,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:34:13,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:34:13,922 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:34:13,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:34:13,923 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:34:13,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:34:13,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:34:13,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:34:13,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:34:13,923 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:34:13,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:34:13,924 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:34:13,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:34:13,924 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:34:13,924 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:34:13,924 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:34:13,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:34:13,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:34:13,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:34:13,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:34:13,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:34:13,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:34:13,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:34:13,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:34:13,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:34:13,926 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:34:13,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:34:13,926 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:34:13,926 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 -> c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 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 -> BEFORE [2023-08-31 23:34:14,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:34:14,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:34:14,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:34:14,171 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:34:14,171 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:34:14,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2023-08-31 23:34:15,055 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:34:15,264 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:34:15,264 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2023-08-31 23:34:15,278 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1460d8b/39d78a08f54a4191adc7b3e7d212a2d1/FLAGcf20e93f0 [2023-08-31 23:34:15,288 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1460d8b/39d78a08f54a4191adc7b3e7d212a2d1 [2023-08-31 23:34:15,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:34:15,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:34:15,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:34:15,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:34:15,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:34:15,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f78ad2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15, skipping insertion in model container [2023-08-31 23:34:15,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:34:15,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:34:15,474 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/safe012_power.oepc.i[995,1008] [2023-08-31 23:34:15,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:34:15,645 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:34:15,652 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/safe012_power.oepc.i[995,1008] [2023-08-31 23:34:15,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:34:15,705 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:34:15,705 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:34:15,710 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:34:15,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15 WrapperNode [2023-08-31 23:34:15,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:34:15,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:34:15,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:34:15,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:34:15,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,742 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-31 23:34:15,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:34:15,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:34:15,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:34:15,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:34:15,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:34:15,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:34:15,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:34:15,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:34:15,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (1/1) ... [2023-08-31 23:34:15,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:34:15,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:34:15,796 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-31 23:34:15,809 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-31 23:34:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:34:15,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:34:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:34:15,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:34:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:34:15,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:34:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:34:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:34:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:34:15,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:34:15,835 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:34:15,989 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:34:15,991 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:34:16,294 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:34:16,568 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:34:16,568 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:34:16,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:34:16 BoogieIcfgContainer [2023-08-31 23:34:16,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:34:16,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:34:16,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:34:16,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:34:16,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:34:15" (1/3) ... [2023-08-31 23:34:16,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335c81d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:34:16, skipping insertion in model container [2023-08-31 23:34:16,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:15" (2/3) ... [2023-08-31 23:34:16,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335c81d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:34:16, skipping insertion in model container [2023-08-31 23:34:16,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:34:16" (3/3) ... [2023-08-31 23:34:16,577 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2023-08-31 23:34:16,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:34:16,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-08-31 23:34:16,588 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:34:16,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:34:16,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 341 flow [2023-08-31 23:34:16,785 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2023-08-31 23:34:16,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:16,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 2/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:34:16,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 341 flow [2023-08-31 23:34:16,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 160 transitions, 329 flow [2023-08-31 23:34:16,798 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:34:16,807 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 160 transitions, 329 flow [2023-08-31 23:34:16,809 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 160 transitions, 329 flow [2023-08-31 23:34:16,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 329 flow [2023-08-31 23:34:16,847 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2023-08-31 23:34:16,847 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:16,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 2/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:34:16,850 INFO L119 LiptonReduction]: Number of co-enabled transitions 5008 [2023-08-31 23:34:26,052 INFO L134 LiptonReduction]: Checked pairs total: 21120 [2023-08-31 23:34:26,053 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-31 23:34:26,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:34:26,065 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;@6c8ad620, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:34:26,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-08-31 23:34:26,066 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:34:26,067 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:26,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:26,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:34:26,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:26,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash 927, now seen corresponding path program 1 times [2023-08-31 23:34:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:26,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555378953] [2023-08-31 23:34:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:26,143 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-31 23:34:26,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555378953] [2023-08-31 23:34:26,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555378953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:26,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:26,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:34:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461246418] [2023-08-31 23:34:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:26,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:34:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:34:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:34:26,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2023-08-31 23:34:26,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:26,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:26,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2023-08-31 23:34:26,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:27,106 INFO L130 PetriNetUnfolder]: 5032/7324 cut-off events. [2023-08-31 23:34:27,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:27,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14624 conditions, 7324 events. 5032/7324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 45495 event pairs, 5032 based on Foata normal form. 135/4045 useless extension candidates. Maximal degree in co-relation 14613. Up to 7254 conditions per place. [2023-08-31 23:34:27,140 INFO L137 encePairwiseOnDemand]: 289/310 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2023-08-31 23:34:27,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 165 flow [2023-08-31 23:34:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:34:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:34:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 312 transitions. [2023-08-31 23:34:27,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032258064516129 [2023-08-31 23:34:27,153 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 312 transitions. [2023-08-31 23:34:27,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 312 transitions. [2023-08-31 23:34:27,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:27,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 312 transitions. [2023-08-31 23:34:27,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,162 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,163 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 312 transitions. [2023-08-31 23:34:27,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 165 flow [2023-08-31 23:34:27,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:34:27,168 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 88 flow [2023-08-31 23:34:27,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 23:34:27,172 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:34:27,172 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 88 flow [2023-08-31 23:34:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:27,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:34:27,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:34:27,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:27,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash 913815, now seen corresponding path program 1 times [2023-08-31 23:34:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991479654] [2023-08-31 23:34:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:27,404 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-31 23:34:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991479654] [2023-08-31 23:34:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991479654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:34:27,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400364066] [2023-08-31 23:34:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:27,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:34:27,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:34:27,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:34:27,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 310 [2023-08-31 23:34:27,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:27,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 310 [2023-08-31 23:34:27,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:27,858 INFO L130 PetriNetUnfolder]: 2257/3371 cut-off events. [2023-08-31 23:34:27,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:27,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6722 conditions, 3371 events. 2257/3371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 19049 event pairs, 2257 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 6719. Up to 3314 conditions per place. [2023-08-31 23:34:27,872 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-31 23:34:27,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 138 flow [2023-08-31 23:34:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:34:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:34:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-31 23:34:27,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.443010752688172 [2023-08-31 23:34:27,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-31 23:34:27,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-31 23:34:27,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:27,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-31 23:34:27,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,878 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 88 flow. Second operand 3 states and 412 transitions. [2023-08-31 23:34:27,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 138 flow [2023-08-31 23:34:27,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:34:27,879 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-31 23:34:27,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-31 23:34:27,880 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-08-31 23:34:27,880 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-31 23:34:27,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:27,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:34:27,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:34:27,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:27,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash 913814, now seen corresponding path program 1 times [2023-08-31 23:34:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:27,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075543961] [2023-08-31 23:34:27,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:34:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075543961] [2023-08-31 23:34:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075543961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:34:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876641053] [2023-08-31 23:34:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:27,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:34:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:27,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:34:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:34:27,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 310 [2023-08-31 23:34:27,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:27,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:27,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 310 [2023-08-31 23:34:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:28,301 INFO L130 PetriNetUnfolder]: 1981/3093 cut-off events. [2023-08-31 23:34:28,301 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:28,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6150 conditions, 3093 events. 1981/3093 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 17684 event pairs, 1227 based on Foata normal form. 0/2507 useless extension candidates. Maximal degree in co-relation 6146. Up to 1807 conditions per place. [2023-08-31 23:34:28,311 INFO L137 encePairwiseOnDemand]: 296/310 looper letters, 33 selfloop transitions, 8 changer transitions 1/44 dead transitions. [2023-08-31 23:34:28,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 180 flow [2023-08-31 23:34:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:34:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:34:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-31 23:34:28,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2023-08-31 23:34:28,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-31 23:34:28,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-31 23:34:28,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:28,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-31 23:34:28,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,316 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 411 transitions. [2023-08-31 23:34:28,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 180 flow [2023-08-31 23:34:28,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:34:28,317 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 135 flow [2023-08-31 23:34:28,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-31 23:34:28,318 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-31 23:34:28,318 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 135 flow [2023-08-31 23:34:28,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:28,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:28,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:34:28,319 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:28,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1242008487, now seen corresponding path program 1 times [2023-08-31 23:34:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080120634] [2023-08-31 23:34:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:28,392 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-31 23:34:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:28,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080120634] [2023-08-31 23:34:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080120634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:28,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:34:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413815621] [2023-08-31 23:34:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:34:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:34:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:34:28,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 310 [2023-08-31 23:34:28,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:28,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 310 [2023-08-31 23:34:28,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:28,700 INFO L130 PetriNetUnfolder]: 1654/2758 cut-off events. [2023-08-31 23:34:28,701 INFO L131 PetriNetUnfolder]: For 662/695 co-relation queries the response was YES. [2023-08-31 23:34:28,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6910 conditions, 2758 events. 1654/2758 cut-off events. For 662/695 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 17192 event pairs, 598 based on Foata normal form. 0/2445 useless extension candidates. Maximal degree in co-relation 6905. Up to 1678 conditions per place. [2023-08-31 23:34:28,713 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-31 23:34:28,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 337 flow [2023-08-31 23:34:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:34:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:34:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-31 23:34:28,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612903225806452 [2023-08-31 23:34:28,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-31 23:34:28,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-31 23:34:28,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:28,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-31 23:34:28,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,717 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 135 flow. Second operand 3 states and 429 transitions. [2023-08-31 23:34:28,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 337 flow [2023-08-31 23:34:28,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:28,722 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2023-08-31 23:34:28,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-31 23:34:28,723 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-31 23:34:28,723 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2023-08-31 23:34:28,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:28,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:28,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:34:28,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:28,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1242008782, now seen corresponding path program 1 times [2023-08-31 23:34:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:28,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556032044] [2023-08-31 23:34:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:28,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:28,903 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-31 23:34:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556032044] [2023-08-31 23:34:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556032044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:34:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398927200] [2023-08-31 23:34:28,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:28,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:34:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:34:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:34:28,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 310 [2023-08-31 23:34:28,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:28,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:28,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 310 [2023-08-31 23:34:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:29,245 INFO L130 PetriNetUnfolder]: 1602/2618 cut-off events. [2023-08-31 23:34:29,246 INFO L131 PetriNetUnfolder]: For 667/676 co-relation queries the response was YES. [2023-08-31 23:34:29,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6791 conditions, 2618 events. 1602/2618 cut-off events. For 667/676 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 15584 event pairs, 354 based on Foata normal form. 0/2254 useless extension candidates. Maximal degree in co-relation 6785. Up to 2053 conditions per place. [2023-08-31 23:34:29,253 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 49 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-31 23:34:29,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 300 flow [2023-08-31 23:34:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:34:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:34:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-31 23:34:29,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44946236559139785 [2023-08-31 23:34:29,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-31 23:34:29,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-31 23:34:29,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:29,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-31 23:34:29,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,258 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 418 transitions. [2023-08-31 23:34:29,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 300 flow [2023-08-31 23:34:29,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:29,259 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 134 flow [2023-08-31 23:34:29,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-31 23:34:29,260 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-08-31 23:34:29,260 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 134 flow [2023-08-31 23:34:29,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:29,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:29,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:34:29,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:29,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 578148941, now seen corresponding path program 1 times [2023-08-31 23:34:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259615189] [2023-08-31 23:34:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:29,345 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-31 23:34:29,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:29,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259615189] [2023-08-31 23:34:29,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259615189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:29,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:29,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:34:29,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82535166] [2023-08-31 23:34:29,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:29,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:34:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:34:29,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:34:29,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 310 [2023-08-31 23:34:29,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:29,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 310 [2023-08-31 23:34:29,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:29,754 INFO L130 PetriNetUnfolder]: 1709/2763 cut-off events. [2023-08-31 23:34:29,755 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2023-08-31 23:34:29,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7158 conditions, 2763 events. 1709/2763 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 15979 event pairs, 586 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 7151. Up to 1117 conditions per place. [2023-08-31 23:34:29,763 INFO L137 encePairwiseOnDemand]: 302/310 looper letters, 58 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2023-08-31 23:34:29,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 364 flow [2023-08-31 23:34:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:34:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:34:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-31 23:34:29,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42983870967741933 [2023-08-31 23:34:29,765 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-31 23:34:29,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-31 23:34:29,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:29,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-31 23:34:29,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-31 23:34:29,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,768 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 134 flow. Second operand 4 states and 533 transitions. [2023-08-31 23:34:29,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 364 flow [2023-08-31 23:34:29,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:29,770 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 192 flow [2023-08-31 23:34:29,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-08-31 23:34:29,771 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:34:29,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 192 flow [2023-08-31 23:34:29,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:29,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:34:29,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:29,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -152434938, now seen corresponding path program 1 times [2023-08-31 23:34:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247477620] [2023-08-31 23:34:29,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:29,903 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-31 23:34:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247477620] [2023-08-31 23:34:29,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247477620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:29,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:29,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:34:29,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438293975] [2023-08-31 23:34:29,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:29,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:34:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:29,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:34:29,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:34:29,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:34:29,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:29,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:29,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:34:29,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:30,276 INFO L130 PetriNetUnfolder]: 1650/2733 cut-off events. [2023-08-31 23:34:30,277 INFO L131 PetriNetUnfolder]: For 1704/1704 co-relation queries the response was YES. [2023-08-31 23:34:30,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7655 conditions, 2733 events. 1650/2733 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16742 event pairs, 592 based on Foata normal form. 30/2552 useless extension candidates. Maximal degree in co-relation 7646. Up to 1652 conditions per place. [2023-08-31 23:34:30,286 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 57 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-31 23:34:30,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 371 flow [2023-08-31 23:34:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:34:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:34:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-31 23:34:30,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43709677419354837 [2023-08-31 23:34:30,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-31 23:34:30,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-31 23:34:30,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:30,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-31 23:34:30,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:30,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:30,290 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:30,290 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 192 flow. Second operand 4 states and 542 transitions. [2023-08-31 23:34:30,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 371 flow [2023-08-31 23:34:30,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:30,300 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 189 flow [2023-08-31 23:34:30,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-31 23:34:30,300 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:34:30,300 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 189 flow [2023-08-31 23:34:30,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:30,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:30,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:30,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:34:30,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:30,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash -152481733, now seen corresponding path program 1 times [2023-08-31 23:34:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974058408] [2023-08-31 23:34:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:30,453 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-31 23:34:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974058408] [2023-08-31 23:34:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974058408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:34:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286417976] [2023-08-31 23:34:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:30,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:34:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:34:30,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:34:30,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:34:30,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:30,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:30,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:34:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:31,090 INFO L130 PetriNetUnfolder]: 2846/4553 cut-off events. [2023-08-31 23:34:31,090 INFO L131 PetriNetUnfolder]: For 4093/4155 co-relation queries the response was YES. [2023-08-31 23:34:31,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13179 conditions, 4553 events. 2846/4553 cut-off events. For 4093/4155 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 29051 event pairs, 841 based on Foata normal form. 60/4154 useless extension candidates. Maximal degree in co-relation 13171. Up to 1639 conditions per place. [2023-08-31 23:34:31,108 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 87 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-31 23:34:31,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 630 flow [2023-08-31 23:34:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:34:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:34:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:34:31,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467741935483871 [2023-08-31 23:34:31,109 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:34:31,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:34:31,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:31,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:34:31,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,112 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,112 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 189 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:34:31,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 630 flow [2023-08-31 23:34:31,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:31,126 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 204 flow [2023-08-31 23:34:31,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-31 23:34:31,127 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2023-08-31 23:34:31,127 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 204 flow [2023-08-31 23:34:31,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:31,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:31,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:34:31,128 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:31,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash -430464791, now seen corresponding path program 1 times [2023-08-31 23:34:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:31,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142062073] [2023-08-31 23:34:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:31,217 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-31 23:34:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:31,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142062073] [2023-08-31 23:34:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142062073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:31,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:31,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:34:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810707176] [2023-08-31 23:34:31,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:31,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:34:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:31,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:34:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:34:31,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 310 [2023-08-31 23:34:31,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:31,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 310 [2023-08-31 23:34:31,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:31,688 INFO L130 PetriNetUnfolder]: 2230/3571 cut-off events. [2023-08-31 23:34:31,688 INFO L131 PetriNetUnfolder]: For 1820/1832 co-relation queries the response was YES. [2023-08-31 23:34:31,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10676 conditions, 3571 events. 2230/3571 cut-off events. For 1820/1832 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 21313 event pairs, 958 based on Foata normal form. 65/3314 useless extension candidates. Maximal degree in co-relation 10666. Up to 1439 conditions per place. [2023-08-31 23:34:31,702 INFO L137 encePairwiseOnDemand]: 299/310 looper letters, 48 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2023-08-31 23:34:31,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 414 flow [2023-08-31 23:34:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:34:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:34:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2023-08-31 23:34:31,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41774193548387095 [2023-08-31 23:34:31,704 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2023-08-31 23:34:31,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2023-08-31 23:34:31,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:31,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2023-08-31 23:34:31,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,707 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,707 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 204 flow. Second operand 4 states and 518 transitions. [2023-08-31 23:34:31,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 414 flow [2023-08-31 23:34:31,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:31,719 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 296 flow [2023-08-31 23:34:31,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-31 23:34:31,720 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2023-08-31 23:34:31,720 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 296 flow [2023-08-31 23:34:31,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:31,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:31,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:34:31,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:31,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 674715787, now seen corresponding path program 1 times [2023-08-31 23:34:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:31,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990770050] [2023-08-31 23:34:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:31,892 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-31 23:34:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990770050] [2023-08-31 23:34:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990770050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:34:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025330390] [2023-08-31 23:34:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:31,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:34:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:34:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:34:31,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2023-08-31 23:34:31,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:31,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:31,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2023-08-31 23:34:31,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:32,281 INFO L130 PetriNetUnfolder]: 2011/3433 cut-off events. [2023-08-31 23:34:32,281 INFO L131 PetriNetUnfolder]: For 3450/3491 co-relation queries the response was YES. [2023-08-31 23:34:32,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11175 conditions, 3433 events. 2011/3433 cut-off events. For 3450/3491 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 22526 event pairs, 687 based on Foata normal form. 15/3103 useless extension candidates. Maximal degree in co-relation 11164. Up to 2061 conditions per place. [2023-08-31 23:34:32,297 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 56 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-08-31 23:34:32,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 486 flow [2023-08-31 23:34:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:34:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:34:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-31 23:34:32,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46021505376344085 [2023-08-31 23:34:32,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-31 23:34:32,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-31 23:34:32,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:32,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-31 23:34:32,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:32,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:32,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:32,301 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 296 flow. Second operand 3 states and 428 transitions. [2023-08-31 23:34:32,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 486 flow [2023-08-31 23:34:32,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:34:32,319 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 306 flow [2023-08-31 23:34:32,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-08-31 23:34:32,321 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2023-08-31 23:34:32,321 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 306 flow [2023-08-31 23:34:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:32,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:32,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:32,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:34:32,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:32,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash -459506924, now seen corresponding path program 1 times [2023-08-31 23:34:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886870264] [2023-08-31 23:34:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:32,623 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-31 23:34:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:32,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886870264] [2023-08-31 23:34:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886870264] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:32,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:34:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064603394] [2023-08-31 23:34:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:34:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:34:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:34:32,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 310 [2023-08-31 23:34:32,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 306 flow. Second operand has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:32,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:32,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 310 [2023-08-31 23:34:32,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:33,420 INFO L130 PetriNetUnfolder]: 1501/2542 cut-off events. [2023-08-31 23:34:33,420 INFO L131 PetriNetUnfolder]: For 3173/3193 co-relation queries the response was YES. [2023-08-31 23:34:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 2542 events. 1501/2542 cut-off events. For 3173/3193 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15385 event pairs, 71 based on Foata normal form. 4/2499 useless extension candidates. Maximal degree in co-relation 8892. Up to 692 conditions per place. [2023-08-31 23:34:33,430 INFO L137 encePairwiseOnDemand]: 302/310 looper letters, 66 selfloop transitions, 19 changer transitions 3/96 dead transitions. [2023-08-31 23:34:33,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 705 flow [2023-08-31 23:34:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:34:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:34:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1068 transitions. [2023-08-31 23:34:33,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3827956989247312 [2023-08-31 23:34:33,432 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1068 transitions. [2023-08-31 23:34:33,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1068 transitions. [2023-08-31 23:34:33,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:33,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1068 transitions. [2023-08-31 23:34:33,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:33,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:33,437 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:33,437 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 306 flow. Second operand 9 states and 1068 transitions. [2023-08-31 23:34:33,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 705 flow [2023-08-31 23:34:33,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:33,449 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 362 flow [2023-08-31 23:34:33,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=362, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-08-31 23:34:33,450 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2023-08-31 23:34:33,450 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 362 flow [2023-08-31 23:34:33,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:33,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:33,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:33,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:34:33,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:33,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash -459506978, now seen corresponding path program 1 times [2023-08-31 23:34:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084487139] [2023-08-31 23:34:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:33,584 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-31 23:34:33,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:33,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084487139] [2023-08-31 23:34:33,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084487139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:33,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:33,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:34:33,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756115878] [2023-08-31 23:34:33,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:33,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:34:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:34:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:34:33,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 310 [2023-08-31 23:34:33,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:33,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:33,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 310 [2023-08-31 23:34:33,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:34,071 INFO L130 PetriNetUnfolder]: 1416/2315 cut-off events. [2023-08-31 23:34:34,071 INFO L131 PetriNetUnfolder]: For 2979/2987 co-relation queries the response was YES. [2023-08-31 23:34:34,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8274 conditions, 2315 events. 1416/2315 cut-off events. For 2979/2987 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12981 event pairs, 477 based on Foata normal form. 61/2353 useless extension candidates. Maximal degree in co-relation 8259. Up to 1234 conditions per place. [2023-08-31 23:34:34,080 INFO L137 encePairwiseOnDemand]: 299/310 looper letters, 59 selfloop transitions, 13 changer transitions 5/79 dead transitions. [2023-08-31 23:34:34,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 658 flow [2023-08-31 23:34:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:34:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:34:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2023-08-31 23:34:34,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40161290322580645 [2023-08-31 23:34:34,082 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2023-08-31 23:34:34,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2023-08-31 23:34:34,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:34,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2023-08-31 23:34:34,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:34,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:34,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:34,087 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 362 flow. Second operand 6 states and 747 transitions. [2023-08-31 23:34:34,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 658 flow [2023-08-31 23:34:34,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 633 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:34:34,099 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 423 flow [2023-08-31 23:34:34,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=423, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-08-31 23:34:34,101 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2023-08-31 23:34:34,101 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 423 flow [2023-08-31 23:34:34,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:34,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:34,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:34,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:34:34,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:34,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash 558879417, now seen corresponding path program 1 times [2023-08-31 23:34:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:34,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67632197] [2023-08-31 23:34:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:35,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-31 23:34:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:35,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67632197] [2023-08-31 23:34:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67632197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:34:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779946110] [2023-08-31 23:34:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:35,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:34:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:34:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:34:35,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 310 [2023-08-31 23:34:35,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 423 flow. Second operand has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:35,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:35,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 310 [2023-08-31 23:34:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:35,710 INFO L130 PetriNetUnfolder]: 1666/2726 cut-off events. [2023-08-31 23:34:35,710 INFO L131 PetriNetUnfolder]: For 4226/4236 co-relation queries the response was YES. [2023-08-31 23:34:35,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9949 conditions, 2726 events. 1666/2726 cut-off events. For 4226/4236 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15900 event pairs, 793 based on Foata normal form. 14/2717 useless extension candidates. Maximal degree in co-relation 9933. Up to 2305 conditions per place. [2023-08-31 23:34:35,719 INFO L137 encePairwiseOnDemand]: 301/310 looper letters, 81 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2023-08-31 23:34:35,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 95 transitions, 823 flow [2023-08-31 23:34:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:34:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:34:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 925 transitions. [2023-08-31 23:34:35,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37298387096774194 [2023-08-31 23:34:35,722 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 925 transitions. [2023-08-31 23:34:35,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 925 transitions. [2023-08-31 23:34:35,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:35,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 925 transitions. [2023-08-31 23:34:35,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.625) internal successors, (925), 8 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-31 23:34:35,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 310.0) internal successors, (2790), 9 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:35,726 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 310.0) internal successors, (2790), 9 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:35,726 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 423 flow. Second operand 8 states and 925 transitions. [2023-08-31 23:34:35,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 95 transitions, 823 flow [2023-08-31 23:34:35,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 800 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:34:35,743 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 542 flow [2023-08-31 23:34:35,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=542, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-08-31 23:34:35,744 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2023-08-31 23:34:35,744 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 542 flow [2023-08-31 23:34:35,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:35,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:35,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:34:35,744 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:35,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1026480381, now seen corresponding path program 2 times [2023-08-31 23:34:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:35,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520391075] [2023-08-31 23:34:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:36,583 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-31 23:34:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:36,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520391075] [2023-08-31 23:34:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520391075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:34:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617397209] [2023-08-31 23:34:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:36,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:34:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:36,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:34:36,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:34:36,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 310 [2023-08-31 23:34:36,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 542 flow. Second operand has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:36,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:36,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 310 [2023-08-31 23:34:36,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:37,437 INFO L130 PetriNetUnfolder]: 1917/3118 cut-off events. [2023-08-31 23:34:37,437 INFO L131 PetriNetUnfolder]: For 5443/5453 co-relation queries the response was YES. [2023-08-31 23:34:37,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11851 conditions, 3118 events. 1917/3118 cut-off events. For 5443/5453 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18538 event pairs, 374 based on Foata normal form. 14/3112 useless extension candidates. Maximal degree in co-relation 11829. Up to 2324 conditions per place. [2023-08-31 23:34:37,451 INFO L137 encePairwiseOnDemand]: 301/310 looper letters, 83 selfloop transitions, 22 changer transitions 0/107 dead transitions. [2023-08-31 23:34:37,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 107 transitions, 987 flow [2023-08-31 23:34:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:34:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:34:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2023-08-31 23:34:37,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37455197132616486 [2023-08-31 23:34:37,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2023-08-31 23:34:37,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2023-08-31 23:34:37,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:37,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2023-08-31 23:34:37,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:37,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:37,459 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:37,459 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 542 flow. Second operand 9 states and 1045 transitions. [2023-08-31 23:34:37,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 107 transitions, 987 flow [2023-08-31 23:34:37,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 973 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-31 23:34:37,481 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 718 flow [2023-08-31 23:34:37,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=718, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2023-08-31 23:34:37,482 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places. [2023-08-31 23:34:37,482 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 718 flow [2023-08-31 23:34:37,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:37,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:37,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:37,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:34:37,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:37,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 13674119, now seen corresponding path program 3 times [2023-08-31 23:34:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304672191] [2023-08-31 23:34:37,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:38,248 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-31 23:34:38,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:38,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304672191] [2023-08-31 23:34:38,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304672191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:34:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741152194] [2023-08-31 23:34:38,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:38,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:34:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:38,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:34:38,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:34:38,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 310 [2023-08-31 23:34:38,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 718 flow. Second operand has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:38,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:38,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 310 [2023-08-31 23:34:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:39,080 INFO L130 PetriNetUnfolder]: 1909/3136 cut-off events. [2023-08-31 23:34:39,080 INFO L131 PetriNetUnfolder]: For 7369/7377 co-relation queries the response was YES. [2023-08-31 23:34:39,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12531 conditions, 3136 events. 1909/3136 cut-off events. For 7369/7377 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 18986 event pairs, 163 based on Foata normal form. 12/3128 useless extension candidates. Maximal degree in co-relation 12505. Up to 1757 conditions per place. [2023-08-31 23:34:39,093 INFO L137 encePairwiseOnDemand]: 302/310 looper letters, 88 selfloop transitions, 39 changer transitions 1/130 dead transitions. [2023-08-31 23:34:39,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 1292 flow [2023-08-31 23:34:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:34:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:34:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1278 transitions. [2023-08-31 23:34:39,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37478005865102637 [2023-08-31 23:34:39,097 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1278 transitions. [2023-08-31 23:34:39,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1278 transitions. [2023-08-31 23:34:39,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:39,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1278 transitions. [2023-08-31 23:34:39,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.18181818181819) internal successors, (1278), 11 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,103 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,103 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 718 flow. Second operand 11 states and 1278 transitions. [2023-08-31 23:34:39,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 1292 flow [2023-08-31 23:34:39,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 130 transitions, 1241 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:39,130 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 929 flow [2023-08-31 23:34:39,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=929, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2023-08-31 23:34:39,131 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 27 predicate places. [2023-08-31 23:34:39,131 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 929 flow [2023-08-31 23:34:39,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:39,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:39,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:34:39,132 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:39,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1359811365, now seen corresponding path program 1 times [2023-08-31 23:34:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:39,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821943990] [2023-08-31 23:34:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:39,180 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-31 23:34:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821943990] [2023-08-31 23:34:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821943990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:39,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:34:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250367615] [2023-08-31 23:34:39,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:39,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:34:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:34:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:34:39,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 310 [2023-08-31 23:34:39,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 929 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:39,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 310 [2023-08-31 23:34:39,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:39,595 INFO L130 PetriNetUnfolder]: 1756/2794 cut-off events. [2023-08-31 23:34:39,595 INFO L131 PetriNetUnfolder]: For 9399/9405 co-relation queries the response was YES. [2023-08-31 23:34:39,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12015 conditions, 2794 events. 1756/2794 cut-off events. For 9399/9405 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15813 event pairs, 988 based on Foata normal form. 79/2869 useless extension candidates. Maximal degree in co-relation 11986. Up to 2178 conditions per place. [2023-08-31 23:34:39,603 INFO L137 encePairwiseOnDemand]: 299/310 looper letters, 33 selfloop transitions, 1 changer transitions 55/91 dead transitions. [2023-08-31 23:34:39,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 1117 flow [2023-08-31 23:34:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:34:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:34:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-31 23:34:39,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4104838709677419 [2023-08-31 23:34:39,605 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-31 23:34:39,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-31 23:34:39,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:39,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-31 23:34:39,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,608 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,608 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 929 flow. Second operand 4 states and 509 transitions. [2023-08-31 23:34:39,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 1117 flow [2023-08-31 23:34:39,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 1052 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-31 23:34:39,640 INFO L231 Difference]: Finished difference. Result has 92 places, 36 transitions, 251 flow [2023-08-31 23:34:39,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=92, PETRI_TRANSITIONS=36} [2023-08-31 23:34:39,641 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 21 predicate places. [2023-08-31 23:34:39,641 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 36 transitions, 251 flow [2023-08-31 23:34:39,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:39,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:39,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:34:39,642 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:39,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1656894509, now seen corresponding path program 1 times [2023-08-31 23:34:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518309699] [2023-08-31 23:34:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:39,803 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-31 23:34:39,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518309699] [2023-08-31 23:34:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518309699] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:34:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586119670] [2023-08-31 23:34:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:39,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:34:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:34:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:34:39,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-31 23:34:39,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 36 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:39,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-31 23:34:39,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:39,940 INFO L130 PetriNetUnfolder]: 287/557 cut-off events. [2023-08-31 23:34:39,940 INFO L131 PetriNetUnfolder]: For 1213/1213 co-relation queries the response was YES. [2023-08-31 23:34:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 557 events. 287/557 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2757 event pairs, 53 based on Foata normal form. 51/604 useless extension candidates. Maximal degree in co-relation 1861. Up to 365 conditions per place. [2023-08-31 23:34:39,942 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 55 selfloop transitions, 7 changer transitions 6/74 dead transitions. [2023-08-31 23:34:39,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 620 flow [2023-08-31 23:34:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:34:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:34:39,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-08-31 23:34:39,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41483870967741937 [2023-08-31 23:34:39,944 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-08-31 23:34:39,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-08-31 23:34:39,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:39,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-08-31 23:34:39,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,947 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,948 INFO L175 Difference]: Start difference. First operand has 92 places, 36 transitions, 251 flow. Second operand 5 states and 643 transitions. [2023-08-31 23:34:39,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 620 flow [2023-08-31 23:34:39,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 564 flow, removed 3 selfloop flow, removed 10 redundant places. [2023-08-31 23:34:39,950 INFO L231 Difference]: Finished difference. Result has 73 places, 42 transitions, 272 flow [2023-08-31 23:34:39,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=73, PETRI_TRANSITIONS=42} [2023-08-31 23:34:39,950 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2023-08-31 23:34:39,950 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 42 transitions, 272 flow [2023-08-31 23:34:39,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:39,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:39,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:39,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:34:39,951 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:39,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1285777627, now seen corresponding path program 1 times [2023-08-31 23:34:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:39,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166940569] [2023-08-31 23:34:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:40,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-31 23:34:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166940569] [2023-08-31 23:34:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166940569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:40,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:34:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110065006] [2023-08-31 23:34:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:40,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:34:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:34:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:34:40,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-31 23:34:40,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 42 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:40,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-31 23:34:40,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:40,289 INFO L130 PetriNetUnfolder]: 229/475 cut-off events. [2023-08-31 23:34:40,290 INFO L131 PetriNetUnfolder]: For 859/859 co-relation queries the response was YES. [2023-08-31 23:34:40,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 475 events. 229/475 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2358 event pairs, 17 based on Foata normal form. 35/506 useless extension candidates. Maximal degree in co-relation 1916. Up to 199 conditions per place. [2023-08-31 23:34:40,292 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 62 selfloop transitions, 13 changer transitions 10/91 dead transitions. [2023-08-31 23:34:40,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 767 flow [2023-08-31 23:34:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:34:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:34:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2023-08-31 23:34:40,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2023-08-31 23:34:40,294 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2023-08-31 23:34:40,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2023-08-31 23:34:40,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:40,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2023-08-31 23:34:40,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,299 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,299 INFO L175 Difference]: Start difference. First operand has 73 places, 42 transitions, 272 flow. Second operand 7 states and 896 transitions. [2023-08-31 23:34:40,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 767 flow [2023-08-31 23:34:40,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 91 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:34:40,301 INFO L231 Difference]: Finished difference. Result has 81 places, 48 transitions, 356 flow [2023-08-31 23:34:40,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=81, PETRI_TRANSITIONS=48} [2023-08-31 23:34:40,302 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2023-08-31 23:34:40,302 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 48 transitions, 356 flow [2023-08-31 23:34:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:40,302 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-31 23:34:40,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:34:40,303 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:40,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1285372720, now seen corresponding path program 1 times [2023-08-31 23:34:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595361839] [2023-08-31 23:34:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:40,448 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-31 23:34:40,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:40,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595361839] [2023-08-31 23:34:40,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595361839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:40,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:40,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:34:40,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139830117] [2023-08-31 23:34:40,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:40,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:34:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:34:40,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:34:40,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:34:40,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 48 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:40,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:34:40,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:40,596 INFO L130 PetriNetUnfolder]: 450/956 cut-off events. [2023-08-31 23:34:40,596 INFO L131 PetriNetUnfolder]: For 3045/3045 co-relation queries the response was YES. [2023-08-31 23:34:40,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 956 events. 450/956 cut-off events. For 3045/3045 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5740 event pairs, 84 based on Foata normal form. 5/953 useless extension candidates. Maximal degree in co-relation 4049. Up to 457 conditions per place. [2023-08-31 23:34:40,599 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 66 selfloop transitions, 2 changer transitions 14/87 dead transitions. [2023-08-31 23:34:40,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 87 transitions, 817 flow [2023-08-31 23:34:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:34:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:34:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-31 23:34:40,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266129032258065 [2023-08-31 23:34:40,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-31 23:34:40,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-31 23:34:40,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:40,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-31 23:34:40,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,604 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,604 INFO L175 Difference]: Start difference. First operand has 81 places, 48 transitions, 356 flow. Second operand 4 states and 529 transitions. [2023-08-31 23:34:40,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 87 transitions, 817 flow [2023-08-31 23:34:40,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 752 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-31 23:34:40,612 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 323 flow [2023-08-31 23:34:40,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2023-08-31 23:34:40,612 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2023-08-31 23:34:40,612 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 323 flow [2023-08-31 23:34:40,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:40,613 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-31 23:34:40,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:34:40,613 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:40,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1087235294, now seen corresponding path program 2 times [2023-08-31 23:34:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933985507] [2023-08-31 23:34:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:40,793 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-31 23:34:40,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:34:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933985507] [2023-08-31 23:34:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933985507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:40,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:40,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:34:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259957515] [2023-08-31 23:34:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:40,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:34:40,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:34:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:34:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:34:40,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 310 [2023-08-31 23:34:40,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 47 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:40,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 310 [2023-08-31 23:34:40,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:34:40,948 INFO L130 PetriNetUnfolder]: 271/583 cut-off events. [2023-08-31 23:34:40,948 INFO L131 PetriNetUnfolder]: For 1424/1432 co-relation queries the response was YES. [2023-08-31 23:34:40,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 583 events. 271/583 cut-off events. For 1424/1432 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3245 event pairs, 22 based on Foata normal form. 28/590 useless extension candidates. Maximal degree in co-relation 2399. Up to 171 conditions per place. [2023-08-31 23:34:40,951 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 50 selfloop transitions, 15 changer transitions 20/90 dead transitions. [2023-08-31 23:34:40,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 797 flow [2023-08-31 23:34:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:34:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:34:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1132 transitions. [2023-08-31 23:34:40,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057347670250896 [2023-08-31 23:34:40,954 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1132 transitions. [2023-08-31 23:34:40,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1132 transitions. [2023-08-31 23:34:40,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:34:40,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1132 transitions. [2023-08-31 23:34:40,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.77777777777777) internal successors, (1132), 9 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-31 23:34:40,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,959 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 310.0) internal successors, (3100), 10 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,959 INFO L175 Difference]: Start difference. First operand has 84 places, 47 transitions, 323 flow. Second operand 9 states and 1132 transitions. [2023-08-31 23:34:40,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 797 flow [2023-08-31 23:34:40,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 746 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-31 23:34:40,963 INFO L231 Difference]: Finished difference. Result has 89 places, 45 transitions, 328 flow [2023-08-31 23:34:40,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=328, PETRI_PLACES=89, PETRI_TRANSITIONS=45} [2023-08-31 23:34:40,963 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2023-08-31 23:34:40,963 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 45 transitions, 328 flow [2023-08-31 23:34:40,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:40,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:40,964 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] [2023-08-31 23:34:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:34:40,964 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:40,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash -186307295, now seen corresponding path program 1 times [2023-08-31 23:34:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:34:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088725313] [2023-08-31 23:34:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:34:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:34:41,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:34:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:34:41,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:34:41,104 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:34:41,105 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-08-31 23:34:41,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-08-31 23:34:41,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-08-31 23:34:41,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-08-31 23:34:41,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-08-31 23:34:41,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-08-31 23:34:41,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-08-31 23:34:41,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-08-31 23:34:41,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-08-31 23:34:41,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-08-31 23:34:41,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-08-31 23:34:41,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-08-31 23:34:41,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-08-31 23:34:41,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-08-31 23:34:41,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-08-31 23:34:41,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-08-31 23:34:41,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-08-31 23:34:41,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-08-31 23:34:41,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-08-31 23:34:41,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-08-31 23:34:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:34:41,117 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:34:41,122 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:34:41,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:34:41,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:34:41 BasicIcfg [2023-08-31 23:34:41,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:34:41,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:34:41,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:34:41,194 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:34:41,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:34:16" (3/4) ... [2023-08-31 23:34:41,196 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:34:41,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:34:41,196 INFO L158 Benchmark]: Toolchain (without parser) took 25905.71ms. Allocated memory was 77.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 53.5MB in the beginning and 879.9MB in the end (delta: -826.4MB). Peak memory consumption was 364.3MB. Max. memory is 16.1GB. [2023-08-31 23:34:41,197 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 77.6MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:34:41,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.22ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 53.3MB in the beginning and 68.7MB in the end (delta: -15.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:34:41,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.17ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 66.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:34:41,197 INFO L158 Benchmark]: Boogie Preprocessor took 23.48ms. Allocated memory is still 96.5MB. Free memory was 66.2MB in the beginning and 64.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:34:41,197 INFO L158 Benchmark]: RCFGBuilder took 803.02ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 63.7MB in the beginning and 84.0MB in the end (delta: -20.3MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2023-08-31 23:34:41,199 INFO L158 Benchmark]: TraceAbstraction took 24620.90ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 83.2MB in the beginning and 879.9MB in the end (delta: -796.6MB). Peak memory consumption was 352.0MB. Max. memory is 16.1GB. [2023-08-31 23:34:41,199 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 1.3GB. Free memory is still 879.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:34:41,200 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.15ms. Allocated memory is still 77.6MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.22ms. Allocated memory was 77.6MB in the beginning and 96.5MB in the end (delta: 18.9MB). Free memory was 53.3MB in the beginning and 68.7MB in the end (delta: -15.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.17ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 66.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.48ms. Allocated memory is still 96.5MB. Free memory was 66.2MB in the beginning and 64.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 803.02ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 63.7MB in the beginning and 84.0MB in the end (delta: -20.3MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24620.90ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 83.2MB in the beginning and 879.9MB in the end (delta: -796.6MB). Peak memory consumption was 352.0MB. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 1.3GB. Free memory is still 879.9MB. 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: 9.2s, 168 PlacesBefore, 71 PlacesAfterwards, 160 TransitionsBefore, 62 TransitionsAfterwards, 5008 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 21120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8339, independent: 7879, independent conditional: 0, independent unconditional: 7879, dependent: 460, dependent conditional: 0, dependent unconditional: 460, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2370, independent: 2297, independent conditional: 0, independent unconditional: 2297, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8339, independent: 5582, independent conditional: 0, independent unconditional: 5582, dependent: 387, dependent conditional: 0, dependent unconditional: 387, unknown: 2370, unknown conditional: 0, unknown unconditional: 2370] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2049, ((void *)0), P0, ((void *)0))=-2, t2049={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2050, ((void *)0), P1, ((void *)0))=-1, t2049={6:0}, t2050={7:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t2051; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2049={6:0}, t2050={7:0}, t2051={5:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051, ((void *)0), P2, ((void *)0))=0, t2049={6:0}, t2050={7:0}, t2051={5:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049={6:0}, t2050={7:0}, t2051={5:0}, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: -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: -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: -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: -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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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 7 procedures, 209 locations, 61 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: 24.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1994 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1522 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 367 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4077 IncrementalHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 154 mSDtfsCounter, 4077 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=929occurred in iteration=15, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-31 23:34:41,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/safe012_power.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 c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:34:42,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:34:42,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:34:42,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:34:42,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:34:42,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:34:42,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:34:42,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:34:42,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:34:42,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:34:42,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:34:42,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:34:42,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:34:42,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:34:42,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:34:42,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:34:42,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:34:42,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:34:42,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:34:42,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:34:42,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:34:42,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:34:42,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:34:42,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:34:42,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:34:42,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:34:42,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:34:42,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:34:42,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:34:42,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:34:42,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:34:42,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:34:42,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:34:42,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:34:42,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:34:42,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:34:42,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:34:42,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:34:42,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:34:42,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:34:42,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:34:42,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:34:42,923 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:34:42,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:34:42,924 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:34:42,924 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:34:42,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:34:42,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:34:42,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:34:42,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:34:42,925 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:34:42,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:34:42,926 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:34:42,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:34:42,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:34:42,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:34:42,928 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:34:42,928 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 -> c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 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 -> BEFORE [2023-08-31 23:34:43,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:34:43,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:34:43,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:34:43,163 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:34:43,163 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:34:43,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2023-08-31 23:34:44,069 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:34:44,256 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:34:44,265 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.oepc.i [2023-08-31 23:34:44,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6029ffa11/02fc7a997d9243509472361efd6fb681/FLAGbb517edc8 [2023-08-31 23:34:44,287 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6029ffa11/02fc7a997d9243509472361efd6fb681 [2023-08-31 23:34:44,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:34:44,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:34:44,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:34:44,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:34:44,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:34:44,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd45819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44, skipping insertion in model container [2023-08-31 23:34:44,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:34:44,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:34:44,442 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/safe012_power.oepc.i[995,1008] [2023-08-31 23:34:44,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:34:44,555 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:34:44,568 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/safe012_power.oepc.i[995,1008] [2023-08-31 23:34:44,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:34:44,649 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:34:44,649 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:34:44,654 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:34:44,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44 WrapperNode [2023-08-31 23:34:44,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:34:44,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:34:44,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:34:44,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:34:44,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,688 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2023-08-31 23:34:44,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:34:44,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:34:44,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:34:44,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:34:44,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,721 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:34:44,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:34:44,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:34:44,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:34:44,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (1/1) ... [2023-08-31 23:34:44,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:34:44,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:34:44,758 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-31 23:34:44,760 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-31 23:34:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:34:44,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:34:44,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:34:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:34:44,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:34:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:34:44,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:34:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:34:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:34:44,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:34:44,785 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:34:44,936 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:34:44,937 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:34:45,355 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:34:45,683 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:34:45,684 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:34:45,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:34:45 BoogieIcfgContainer [2023-08-31 23:34:45,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:34:45,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:34:45,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:34:45,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:34:45,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:34:44" (1/3) ... [2023-08-31 23:34:45,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737c1c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:34:45, skipping insertion in model container [2023-08-31 23:34:45,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:34:44" (2/3) ... [2023-08-31 23:34:45,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737c1c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:34:45, skipping insertion in model container [2023-08-31 23:34:45,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:34:45" (3/3) ... [2023-08-31 23:34:45,691 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2023-08-31 23:34:45,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:34:45,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-08-31 23:34:45,703 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:34:45,804 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:34:45,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 343 flow [2023-08-31 23:34:45,897 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2023-08-31 23:34:45,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:45,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:34:45,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 164 transitions, 343 flow [2023-08-31 23:34:45,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 331 flow [2023-08-31 23:34:45,910 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:34:45,924 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 331 flow [2023-08-31 23:34:45,927 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 331 flow [2023-08-31 23:34:45,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 331 flow [2023-08-31 23:34:45,964 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2023-08-31 23:34:45,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:45,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 203 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-31 23:34:45,982 INFO L119 LiptonReduction]: Number of co-enabled transitions 5008 [2023-08-31 23:34:59,723 INFO L134 LiptonReduction]: Checked pairs total: 20709 [2023-08-31 23:34:59,723 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-31 23:34:59,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:34:59,737 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;@7c71a7b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:34:59,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-08-31 23:34:59,739 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:34:59,739 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:34:59,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:34:59,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:34:59,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:34:59,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:34:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 928, now seen corresponding path program 1 times [2023-08-31 23:34:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:34:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107214792] [2023-08-31 23:34:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:34:59,751 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-31 23:34:59,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:34:59,754 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-31 23:34:59,778 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-31 23:34:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:34:59,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:34:59,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:34:59,851 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-31 23:34:59,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:34:59,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:34:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107214792] [2023-08-31 23:34:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107214792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:34:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:34:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:34:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583006077] [2023-08-31 23:34:59,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:34:59,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:34:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:34:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:34:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:34:59,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 310 [2023-08-31 23:34:59,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:34:59,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:34:59,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 310 [2023-08-31 23:34:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:00,747 INFO L130 PetriNetUnfolder]: 5032/7319 cut-off events. [2023-08-31 23:35:00,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:35:00,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14619 conditions, 7319 events. 5032/7319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 45347 event pairs, 5032 based on Foata normal form. 135/4040 useless extension candidates. Maximal degree in co-relation 14608. Up to 7254 conditions per place. [2023-08-31 23:35:00,784 INFO L137 encePairwiseOnDemand]: 289/310 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2023-08-31 23:35:00,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 165 flow [2023-08-31 23:35:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:35:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:35:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2023-08-31 23:35:00,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064516129032258 [2023-08-31 23:35:00,797 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2023-08-31 23:35:00,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2023-08-31 23:35:00,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:00,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2023-08-31 23:35:00,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:00,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:00,818 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:00,819 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 314 transitions. [2023-08-31 23:35:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 165 flow [2023-08-31 23:35:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:35:00,826 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 88 flow [2023-08-31 23:35:00,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 23:35:00,830 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:35:00,830 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 88 flow [2023-08-31 23:35:00,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:00,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:00,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:35:00,848 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-31 23:35:01,039 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-31 23:35:01,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:01,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 916761, now seen corresponding path program 1 times [2023-08-31 23:35:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34591894] [2023-08-31 23:35:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:01,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-31 23:35:01,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:01,043 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-31 23:35:01,045 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-31 23:35:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:01,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:35:01,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:01,194 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:35:01,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:35:01,217 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-31 23:35:01,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:01,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:01,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34591894] [2023-08-31 23:35:01,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34591894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:35:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96482480] [2023-08-31 23:35:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:01,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:35:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:35:01,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:35:01,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:35:01,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:01,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:01,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:35:01,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:01,841 INFO L130 PetriNetUnfolder]: 3241/4759 cut-off events. [2023-08-31 23:35:01,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:35:01,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9526 conditions, 4759 events. 3241/4759 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 27451 event pairs, 2121 based on Foata normal form. 120/3062 useless extension candidates. Maximal degree in co-relation 9523. Up to 2776 conditions per place. [2023-08-31 23:35:01,858 INFO L137 encePairwiseOnDemand]: 302/310 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-31 23:35:01,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 200 flow [2023-08-31 23:35:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:35:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:35:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:35:01,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2023-08-31 23:35:01,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:35:01,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:35:01,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:01,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:35:01,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:01,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:01,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:01,864 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 88 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:35:01,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 200 flow [2023-08-31 23:35:01,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:35:01,865 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 98 flow [2023-08-31 23:35:01,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-31 23:35:01,865 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2023-08-31 23:35:01,865 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 98 flow [2023-08-31 23:35:01,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:01,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:01,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:35:01,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 23:35:02,072 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-31 23:35:02,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:02,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:02,073 INFO L85 PathProgramCache]: Analyzing trace with hash 916762, now seen corresponding path program 1 times [2023-08-31 23:35:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:02,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852864103] [2023-08-31 23:35:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:02,074 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-31 23:35:02,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:02,074 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-31 23:35:02,077 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-31 23:35:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:02,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:35:02,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:02,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:35:02,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:35:02,243 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-31 23:35:02,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:02,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:02,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852864103] [2023-08-31 23:35:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852864103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:02,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:35:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897898525] [2023-08-31 23:35:02,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:02,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:35:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:35:02,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:35:02,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2023-08-31 23:35:02,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:02,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:02,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2023-08-31 23:35:02,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:02,635 INFO L130 PetriNetUnfolder]: 1229/1885 cut-off events. [2023-08-31 23:35:02,635 INFO L131 PetriNetUnfolder]: For 105/129 co-relation queries the response was YES. [2023-08-31 23:35:02,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 1885 events. 1229/1885 cut-off events. For 105/129 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 9711 event pairs, 1229 based on Foata normal form. 0/1599 useless extension candidates. Maximal degree in co-relation 4027. Up to 1848 conditions per place. [2023-08-31 23:35:02,644 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 27 selfloop transitions, 1 changer transitions 1/33 dead transitions. [2023-08-31 23:35:02,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 144 flow [2023-08-31 23:35:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:35:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:35:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:35:02,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44731182795698926 [2023-08-31 23:35:02,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:35:02,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:35:02,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:02,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:35:02,647 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-31 23:35:02,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:02,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:02,649 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 98 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:35:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 144 flow [2023-08-31 23:35:02,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:35:02,651 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 82 flow [2023-08-31 23:35:02,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-31 23:35:02,652 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-08-31 23:35:02,654 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 82 flow [2023-08-31 23:35:02,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:02,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:02,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:35:02,663 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 (4)] Ended with exit code 0 [2023-08-31 23:35:02,860 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-31 23:35:02,861 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:02,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash -887671296, now seen corresponding path program 1 times [2023-08-31 23:35:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:02,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659181194] [2023-08-31 23:35:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:02,862 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-31 23:35:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:02,863 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-31 23:35:02,865 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-31 23:35:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:02,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:35:02,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:02,996 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-31 23:35:02,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:02,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659181194] [2023-08-31 23:35:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659181194] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:02,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:02,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:35:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811629608] [2023-08-31 23:35:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:02,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:35:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:35:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:35:03,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:35:03,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:03,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:35:03,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:03,174 INFO L130 PetriNetUnfolder]: 588/989 cut-off events. [2023-08-31 23:35:03,174 INFO L131 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2023-08-31 23:35:03,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 989 events. 588/989 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4884 event pairs, 191 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2106. Up to 921 conditions per place. [2023-08-31 23:35:03,178 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-31 23:35:03,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 194 flow [2023-08-31 23:35:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:35:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:35:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-31 23:35:03,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2023-08-31 23:35:03,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-31 23:35:03,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-31 23:35:03,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:03,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-31 23:35:03,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,183 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 82 flow. Second operand 3 states and 414 transitions. [2023-08-31 23:35:03,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 194 flow [2023-08-31 23:35:03,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:35:03,185 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2023-08-31 23:35:03,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-31 23:35:03,186 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-08-31 23:35:03,186 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2023-08-31 23:35:03,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:03,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:35:03,193 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 (5)] Ended with exit code 0 [2023-08-31 23:35:03,393 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-31 23:35:03,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:03,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2033365833, now seen corresponding path program 1 times [2023-08-31 23:35:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426117001] [2023-08-31 23:35:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:03,395 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-31 23:35:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:03,395 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-31 23:35:03,396 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-31 23:35:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:03,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:35:03,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:03,534 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-31 23:35:03,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:03,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426117001] [2023-08-31 23:35:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426117001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:03,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:35:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327775448] [2023-08-31 23:35:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:03,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:35:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:35:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:35:03,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:35:03,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:03,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:35:03,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:03,682 INFO L130 PetriNetUnfolder]: 161/334 cut-off events. [2023-08-31 23:35:03,682 INFO L131 PetriNetUnfolder]: For 60/62 co-relation queries the response was YES. [2023-08-31 23:35:03,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 334 events. 161/334 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1298 event pairs, 43 based on Foata normal form. 16/308 useless extension candidates. Maximal degree in co-relation 832. Up to 202 conditions per place. [2023-08-31 23:35:03,684 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-08-31 23:35:03,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 261 flow [2023-08-31 23:35:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:35:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:35:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-31 23:35:03,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2023-08-31 23:35:03,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-31 23:35:03,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-31 23:35:03,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:03,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-31 23:35:03,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,689 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,689 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 548 transitions. [2023-08-31 23:35:03,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 261 flow [2023-08-31 23:35:03,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:35:03,690 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2023-08-31 23:35:03,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-31 23:35:03,691 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-08-31 23:35:03,691 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2023-08-31 23:35:03,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:03,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:03,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:35:03,703 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-31 23:35:03,899 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-31 23:35:03,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:03,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1109804226, now seen corresponding path program 1 times [2023-08-31 23:35:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924107712] [2023-08-31 23:35:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:03,900 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-31 23:35:03,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:03,901 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-31 23:35:03,902 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-31 23:35:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:04,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:35:04,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:04,045 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-31 23:35:04,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:04,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:04,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924107712] [2023-08-31 23:35:04,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924107712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:35:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178956055] [2023-08-31 23:35:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:04,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:35:04,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:35:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:35:04,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:35:04,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:04,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:35:04,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:04,219 INFO L130 PetriNetUnfolder]: 82/172 cut-off events. [2023-08-31 23:35:04,220 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-31 23:35:04,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 172 events. 82/172 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 504 event pairs, 24 based on Foata normal form. 7/172 useless extension candidates. Maximal degree in co-relation 497. Up to 70 conditions per place. [2023-08-31 23:35:04,221 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 37 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2023-08-31 23:35:04,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 263 flow [2023-08-31 23:35:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:35:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:35:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-31 23:35:04,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4316129032258065 [2023-08-31 23:35:04,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-31 23:35:04,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-31 23:35:04,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:04,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-31 23:35:04,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,226 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,226 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 669 transitions. [2023-08-31 23:35:04,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 263 flow [2023-08-31 23:35:04,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 247 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:35:04,227 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-31 23:35:04,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-31 23:35:04,228 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-08-31 23:35:04,228 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-31 23:35:04,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:04,229 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] [2023-08-31 23:35:04,238 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-31 23:35:04,436 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-31 23:35:04,436 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:04,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1908138245, now seen corresponding path program 1 times [2023-08-31 23:35:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462407781] [2023-08-31 23:35:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:04,437 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-31 23:35:04,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:04,438 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-31 23:35:04,439 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-31 23:35:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:04,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:35:04,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:04,601 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-31 23:35:04,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:04,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462407781] [2023-08-31 23:35:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462407781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:04,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:35:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438535751] [2023-08-31 23:35:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:35:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:35:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:35:04,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 310 [2023-08-31 23:35:04,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 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-31 23:35:04,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:04,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 310 [2023-08-31 23:35:04,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:04,764 INFO L130 PetriNetUnfolder]: 94/211 cut-off events. [2023-08-31 23:35:04,764 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2023-08-31 23:35:04,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 211 events. 94/211 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 807 event pairs, 13 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 588. Up to 139 conditions per place. [2023-08-31 23:35:04,765 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-31 23:35:04,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-08-31 23:35:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:35:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:35:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-31 23:35:04,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2023-08-31 23:35:04,767 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-31 23:35:04,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-31 23:35:04,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:04,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-31 23:35:04,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,769 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:04,769 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 525 transitions. [2023-08-31 23:35:04,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-08-31 23:35:04,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:35:04,771 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2023-08-31 23:35:04,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-31 23:35:04,771 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-08-31 23:35:04,771 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2023-08-31 23:35:04,772 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-31 23:35:04,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:04,772 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] [2023-08-31 23:35:04,779 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 (8)] Ended with exit code 0 [2023-08-31 23:35:04,979 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-31 23:35:04,979 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:04,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1979677820, now seen corresponding path program 1 times [2023-08-31 23:35:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415164893] [2023-08-31 23:35:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:04,981 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-31 23:35:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:04,981 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-31 23:35:04,983 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-31 23:35:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:05,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:35:05,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:05,155 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-31 23:35:05,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:05,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415164893] [2023-08-31 23:35:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415164893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:35:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943468379] [2023-08-31 23:35:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:05,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:35:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:35:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:35:05,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 310 [2023-08-31 23:35:05,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:05,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 310 [2023-08-31 23:35:05,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:05,325 INFO L130 PetriNetUnfolder]: 94/210 cut-off events. [2023-08-31 23:35:05,326 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2023-08-31 23:35:05,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 210 events. 94/210 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 792 event pairs, 13 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 569. Up to 141 conditions per place. [2023-08-31 23:35:05,327 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-31 23:35:05,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 245 flow [2023-08-31 23:35:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:35:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:35:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-31 23:35:05,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2023-08-31 23:35:05,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-31 23:35:05,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-31 23:35:05,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:05,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-31 23:35:05,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,332 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 532 transitions. [2023-08-31 23:35:05,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 245 flow [2023-08-31 23:35:05,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:35:05,333 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-08-31 23:35:05,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:35:05,334 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-08-31 23:35:05,334 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-08-31 23:35:05,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:05,334 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] [2023-08-31 23:35:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:35:05,542 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-31 23:35:05,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:05,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1552673733, now seen corresponding path program 1 times [2023-08-31 23:35:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256767657] [2023-08-31 23:35:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:35:05,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:35:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:05,544 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-31 23:35:05,546 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-31 23:35:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:35:05,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:35:05,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:05,706 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-31 23:35:05,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:05,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256767657] [2023-08-31 23:35:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256767657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:05,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:05,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:35:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441134193] [2023-08-31 23:35:05,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:05,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:35:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:05,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:35:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:35:05,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:35:05,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 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-31 23:35:05,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:05,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:35:05,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:05,870 INFO L130 PetriNetUnfolder]: 160/336 cut-off events. [2023-08-31 23:35:05,871 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-08-31 23:35:05,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 336 events. 160/336 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1441 event pairs, 30 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 933. Up to 139 conditions per place. [2023-08-31 23:35:05,872 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 67 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-31 23:35:05,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 411 flow [2023-08-31 23:35:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:35:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:35:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-31 23:35:05,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432258064516129 [2023-08-31 23:35:05,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-31 23:35:05,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-31 23:35:05,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:05,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-31 23:35:05,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,878 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:05,878 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 5 states and 670 transitions. [2023-08-31 23:35:05,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 411 flow [2023-08-31 23:35:05,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:35:05,880 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 131 flow [2023-08-31 23:35:05,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-31 23:35:05,880 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-08-31 23:35:05,880 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 131 flow [2023-08-31 23:35:05,881 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-31 23:35:05,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:05,881 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] [2023-08-31 23:35:05,893 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-31 23:35:06,088 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-31 23:35:06,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:06,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash 323694123, now seen corresponding path program 2 times [2023-08-31 23:35:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:06,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17200077] [2023-08-31 23:35:06,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:35:06,089 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-31 23:35:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:06,090 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-31 23:35:06,091 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-31 23:35:06,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:35:06,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:35:06,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:35:06,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:06,291 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-31 23:35:06,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:06,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17200077] [2023-08-31 23:35:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17200077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:06,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:06,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:35:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363998191] [2023-08-31 23:35:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:06,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:35:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:35:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:35:06,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:35:06,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 131 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-31 23:35:06,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:06,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:35:06,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:06,457 INFO L130 PetriNetUnfolder]: 194/422 cut-off events. [2023-08-31 23:35:06,457 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2023-08-31 23:35:06,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 422 events. 194/422 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2095 event pairs, 13 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 1308. Up to 186 conditions per place. [2023-08-31 23:35:06,459 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 67 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2023-08-31 23:35:06,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 457 flow [2023-08-31 23:35:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:35:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:35:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 796 transitions. [2023-08-31 23:35:06,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42795698924731185 [2023-08-31 23:35:06,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 796 transitions. [2023-08-31 23:35:06,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 796 transitions. [2023-08-31 23:35:06,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:06,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 796 transitions. [2023-08-31 23:35:06,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:06,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:06,468 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:06,468 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 131 flow. Second operand 6 states and 796 transitions. [2023-08-31 23:35:06,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 457 flow [2023-08-31 23:35:06,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:35:06,470 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 172 flow [2023-08-31 23:35:06,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-08-31 23:35:06,470 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -15 predicate places. [2023-08-31 23:35:06,470 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 172 flow [2023-08-31 23:35:06,471 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-31 23:35:06,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:06,471 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] [2023-08-31 23:35:06,479 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-31 23:35:06,678 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-31 23:35:06,679 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:06,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -794553249, now seen corresponding path program 3 times [2023-08-31 23:35:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814396632] [2023-08-31 23:35:06,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:35:06,680 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-31 23:35:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:06,681 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-31 23:35:06,682 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-31 23:35:06,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:35:06,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:35:06,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:35:06,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:35:06,847 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-31 23:35:06,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:35:06,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:35:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814396632] [2023-08-31 23:35:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814396632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:35:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:35:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:35:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692380061] [2023-08-31 23:35:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:35:06,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:35:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:35:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:35:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:35:06,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2023-08-31 23:35:06,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 172 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-31 23:35:06,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:35:06,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2023-08-31 23:35:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:35:07,074 INFO L130 PetriNetUnfolder]: 217/493 cut-off events. [2023-08-31 23:35:07,075 INFO L131 PetriNetUnfolder]: For 627/627 co-relation queries the response was YES. [2023-08-31 23:35:07,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 493 events. 217/493 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2587 event pairs, 30 based on Foata normal form. 1/494 useless extension candidates. Maximal degree in co-relation 1694. Up to 214 conditions per place. [2023-08-31 23:35:07,077 INFO L137 encePairwiseOnDemand]: 305/310 looper letters, 69 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-08-31 23:35:07,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 510 flow [2023-08-31 23:35:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:35:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:35:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-31 23:35:07,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295698924731183 [2023-08-31 23:35:07,080 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-31 23:35:07,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-31 23:35:07,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:35:07,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-31 23:35:07,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:07,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:07,086 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:35:07,086 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 172 flow. Second operand 6 states and 799 transitions. [2023-08-31 23:35:07,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 510 flow [2023-08-31 23:35:07,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:35:07,090 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 217 flow [2023-08-31 23:35:07,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-08-31 23:35:07,090 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2023-08-31 23:35:07,091 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 217 flow [2023-08-31 23:35:07,091 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-31 23:35:07,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:35:07,091 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] [2023-08-31 23:35:07,103 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-31 23:35:07,298 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-31 23:35:07,299 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-08-31 23:35:07,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:35:07,299 INFO L85 PathProgramCache]: Analyzing trace with hash 953730251, now seen corresponding path program 4 times [2023-08-31 23:35:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:35:07,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583702845] [2023-08-31 23:35:07,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:35:07,299 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-31 23:35:07,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:35:07,300 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-31 23:35:07,301 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-31 23:35:07,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:35:07,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:35:07,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:35:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:35:07,616 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:35:07,616 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:35:07,617 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-08-31 23:35:07,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-08-31 23:35:07,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-08-31 23:35:07,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-08-31 23:35:07,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-08-31 23:35:07,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-08-31 23:35:07,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-08-31 23:35:07,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-08-31 23:35:07,653 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-31 23:35:07,834 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-31 23:35:07,834 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:35:07,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:35:07,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:35:07,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:35:07 BasicIcfg [2023-08-31 23:35:07,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:35:07,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:35:07,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:35:07,898 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:35:07,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:34:45" (3/4) ... [2023-08-31 23:35:07,900 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:35:07,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:35:07,900 INFO L158 Benchmark]: Toolchain (without parser) took 23611.04ms. Allocated memory was 100.7MB in the beginning and 612.4MB in the end (delta: 511.7MB). Free memory was 78.9MB in the beginning and 425.4MB in the end (delta: -346.4MB). Peak memory consumption was 164.9MB. Max. memory is 16.1GB. [2023-08-31 23:35:07,901 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 65.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:35:07,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.13ms. Allocated memory is still 100.7MB. Free memory was 78.7MB in the beginning and 78.4MB in the end (delta: 311.0kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-08-31 23:35:07,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.30ms. Allocated memory is still 100.7MB. Free memory was 78.4MB in the beginning and 75.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:35:07,901 INFO L158 Benchmark]: Boogie Preprocessor took 31.82ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:35:07,901 INFO L158 Benchmark]: RCFGBuilder took 960.64ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 73.7MB in the beginning and 63.5MB in the end (delta: 10.2MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2023-08-31 23:35:07,902 INFO L158 Benchmark]: TraceAbstraction took 22210.88ms. Allocated memory was 121.6MB in the beginning and 612.4MB in the end (delta: 490.7MB). Free memory was 63.0MB in the beginning and 426.4MB in the end (delta: -363.4MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2023-08-31 23:35:07,902 INFO L158 Benchmark]: Witness Printer took 2.19ms. Allocated memory is still 612.4MB. Free memory was 426.4MB in the beginning and 425.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:35:07,903 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.13ms. Allocated memory is still 65.0MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.13ms. Allocated memory is still 100.7MB. Free memory was 78.7MB in the beginning and 78.4MB in the end (delta: 311.0kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.30ms. Allocated memory is still 100.7MB. Free memory was 78.4MB in the beginning and 75.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.82ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 960.64ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 73.7MB in the beginning and 63.5MB in the end (delta: 10.2MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22210.88ms. Allocated memory was 121.6MB in the beginning and 612.4MB in the end (delta: 490.7MB). Free memory was 63.0MB in the beginning and 426.4MB in the end (delta: -363.4MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 2.19ms. Allocated memory is still 612.4MB. Free memory was 426.4MB in the beginning and 425.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8s, 169 PlacesBefore, 71 PlacesAfterwards, 161 TransitionsBefore, 62 TransitionsAfterwards, 5008 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 20709 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8577, independent: 8127, independent conditional: 0, independent unconditional: 8127, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2397, independent: 2325, independent conditional: 0, independent unconditional: 2325, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8577, independent: 5802, independent conditional: 0, independent unconditional: 5802, dependent: 378, dependent conditional: 0, dependent unconditional: 378, unknown: 2397, unknown conditional: 0, unknown unconditional: 2397] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 440, Positive conditional cache size: 0, Positive unconditional cache size: 440, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2049, ((void *)0), P0, ((void *)0))=0, t2049={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2050, ((void *)0), P1, ((void *)0))=1, t2049={7:0}, t2050={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t2051; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2049={7:0}, t2050={14:0}, t2051={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051, ((void *)0), P2, ((void *)0))=2, t2049={7:0}, t2050={14:0}, t2051={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2049={7:0}, t2050={14:0}, t2051={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: -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: -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: -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: -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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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 7 procedures, 210 locations, 61 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: 22.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1164 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 30 mSDtfsCounter, 1164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=11, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 665 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1540 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:35:07,927 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