./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.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/mix055_power.oepc_pso.oepc_rmo.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 b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --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:24:31,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:24:31,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:24:31,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:24:31,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:24:31,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:24:31,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:24:31,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:24:31,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:24:31,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:24:31,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:24:31,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:24:31,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:24:31,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:24:31,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:24:31,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:24:31,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:24:31,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:24:31,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:24:31,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:24:31,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:24:31,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:24:31,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:24:31,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:24:31,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:24:31,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:24:31,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:24:31,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:24:31,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:24:31,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:24:31,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:24:31,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:24:31,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:24:31,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:24:31,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:24:31,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:24:31,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:24:31,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:24:31,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:24:31,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:24:31,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:24:31,773 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:24:31,798 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:24:31,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:24:31,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:24:31,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:24:31,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:24:31,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:24:31,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:24:31,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:24:31,802 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:24:31,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:24:31,802 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:24:31,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:24:31,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:24:31,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:24:31,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:24:31,803 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:24:31,804 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:24:31,804 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:24:31,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:24:31,804 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:24:31,804 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:24:31,804 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:24:31,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:24:31,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:24:31,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:24:31,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:24:31,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:24:31,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:24:31,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:24:31,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:24:31,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:24:31,806 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:24:31,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:24:31,807 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:24:31,807 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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 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:24:32,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:24:32,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:24:32,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:24:32,159 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:24:32,159 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:24:32,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:24:33,241 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:24:33,504 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:24:33,509 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:24:33,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d640b6f/9c0ff8aef12849189473bfff36e9b3fe/FLAG7a8ab5bf4 [2023-08-31 23:24:33,534 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d640b6f/9c0ff8aef12849189473bfff36e9b3fe [2023-08-31 23:24:33,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:24:33,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:24:33,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:24:33,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:24:33,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:24:33,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:24:33" (1/1) ... [2023-08-31 23:24:33,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc889e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:33, skipping insertion in model container [2023-08-31 23:24:33,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:24:33" (1/1) ... [2023-08-31 23:24:33,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:24:33,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:24:33,711 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:24:33,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:24:33,944 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:24:33,976 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:24:34,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:24:34,077 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:24:34,077 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:24:34,083 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:24:34,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34 WrapperNode [2023-08-31 23:24:34,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:24:34,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:24:34,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:24:34,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:24:34,091 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:24:34" (1/1) ... [2023-08-31 23:24:34,119 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:24:34" (1/1) ... [2023-08-31 23:24:34,158 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-31 23:24:34,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:24:34,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:24:34,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:24:34,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:24:34,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:24:34,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:24:34,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:24:34,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:24:34,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (1/1) ... [2023-08-31 23:24:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:24:34,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:24:34,246 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:24:34,268 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:24:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:24:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:24:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:24:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:24:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:24:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:24:34,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:24:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:24:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:24:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:24:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:24:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:24:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:24:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:24:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:24:34,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:24:34,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:24:34,285 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:24:34,431 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:24:34,444 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:24:34,832 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:24:34,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:24:34,974 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:24:34,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:34 BoogieIcfgContainer [2023-08-31 23:24:34,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:24:34,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:24:34,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:24:34,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:24:34,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:24:33" (1/3) ... [2023-08-31 23:24:34,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22de0a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:24:34, skipping insertion in model container [2023-08-31 23:24:34,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:24:34" (2/3) ... [2023-08-31 23:24:34,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22de0a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:24:34, skipping insertion in model container [2023-08-31 23:24:34,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:34" (3/3) ... [2023-08-31 23:24:34,985 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:24:35,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:24:35,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:24:35,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:24:35,070 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:24:35,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-31 23:24:35,177 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-31 23:24:35,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:35,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:24:35,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-31 23:24:35,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-31 23:24:35,196 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:24:35,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-31 23:24:35,213 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-31 23:24:35,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-31 23:24:35,244 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-31 23:24:35,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:35,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:24:35,248 INFO L119 LiptonReduction]: Number of co-enabled transitions 3412 [2023-08-31 23:24:40,008 INFO L134 LiptonReduction]: Checked pairs total: 9977 [2023-08-31 23:24:40,008 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-31 23:24:40,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:24:40,031 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;@34fb7fad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:24:40,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:24:40,033 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:24:40,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:40,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:40,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:24:40,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:40,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 597, now seen corresponding path program 1 times [2023-08-31 23:24:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:40,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323419818] [2023-08-31 23:24:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:40,138 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:24:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323419818] [2023-08-31 23:24:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323419818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:24:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078941013] [2023-08-31 23:24:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:40,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:24:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:40,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:24:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:24:40,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-31 23:24:40,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:24:40,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:40,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-31 23:24:40,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:41,697 INFO L130 PetriNetUnfolder]: 8719/11751 cut-off events. [2023-08-31 23:24:41,698 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-31 23:24:41,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23699 conditions, 11751 events. 8719/11751 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 59618 event pairs, 8719 based on Foata normal form. 0/10324 useless extension candidates. Maximal degree in co-relation 23687. Up to 11731 conditions per place. [2023-08-31 23:24:41,767 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 28 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:24:41,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 130 flow [2023-08-31 23:24:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:24:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:24:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-31 23:24:41,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295202952029521 [2023-08-31 23:24:41,784 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-31 23:24:41,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-31 23:24:41,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:41,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-31 23:24:41,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:24:41,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states 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:24:41,798 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states 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:24:41,800 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 287 transitions. [2023-08-31 23:24:41,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 130 flow [2023-08-31 23:24:41,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:24:41,808 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:24:41,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:24:41,814 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:24:41,814 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:24:41,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:24:41,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:41,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:24:41,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:24:41,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:41,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash 585579, now seen corresponding path program 1 times [2023-08-31 23:24:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325254807] [2023-08-31 23:24:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:42,109 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:24:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325254807] [2023-08-31 23:24:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325254807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:42,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:42,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:24:42,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837656731] [2023-08-31 23:24:42,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:42,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:24:42,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:42,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:24:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:24:42,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-08-31 23:24:42,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 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:24:42,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:42,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-08-31 23:24:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:43,173 INFO L130 PetriNetUnfolder]: 6855/9422 cut-off events. [2023-08-31 23:24:43,173 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:24:43,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18859 conditions, 9422 events. 6855/9422 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 48209 event pairs, 2603 based on Foata normal form. 0/8777 useless extension candidates. Maximal degree in co-relation 18856. Up to 7399 conditions per place. [2023-08-31 23:24:43,222 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-31 23:24:43,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 216 flow [2023-08-31 23:24:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-31 23:24:43,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190651906519065 [2023-08-31 23:24:43,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-31 23:24:43,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-31 23:24:43,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:43,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-31 23:24:43,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states 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:24:43,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:43,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:43,231 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 422 transitions. [2023-08-31 23:24:43,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 216 flow [2023-08-31 23:24:43,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:24:43,233 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-31 23:24:43,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:24:43,234 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:24:43,234 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-31 23:24:43,234 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:24:43,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:43,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:43,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:24:43,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:43,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash -131906618, now seen corresponding path program 1 times [2023-08-31 23:24:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204436178] [2023-08-31 23:24:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:43,665 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:24:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204436178] [2023-08-31 23:24:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204436178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:43,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:24:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291642583] [2023-08-31 23:24:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:43,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:24:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:24:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:24:43,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 271 [2023-08-31 23:24:43,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:24:43,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:43,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 271 [2023-08-31 23:24:43,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:46,384 INFO L130 PetriNetUnfolder]: 21370/28814 cut-off events. [2023-08-31 23:24:46,384 INFO L131 PetriNetUnfolder]: For 1358/1358 co-relation queries the response was YES. [2023-08-31 23:24:46,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59496 conditions, 28814 events. 21370/28814 cut-off events. For 1358/1358 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 155174 event pairs, 7502 based on Foata normal form. 0/28214 useless extension candidates. Maximal degree in co-relation 59492. Up to 15875 conditions per place. [2023-08-31 23:24:46,543 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-31 23:24:46,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 230 flow [2023-08-31 23:24:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-31 23:24:46,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944649446494465 [2023-08-31 23:24:46,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-31 23:24:46,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-31 23:24:46,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:46,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-31 23:24:46,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:24:46,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:46,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:46,549 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 402 transitions. [2023-08-31 23:24:46,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 230 flow [2023-08-31 23:24:46,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:46,552 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2023-08-31 23:24:46,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-31 23:24:46,554 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-31 23:24:46,556 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2023-08-31 23:24:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:24:46,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:46,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:46,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:24:46,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:46,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 205860737, now seen corresponding path program 1 times [2023-08-31 23:24:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592056623] [2023-08-31 23:24:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:46,790 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:24:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592056623] [2023-08-31 23:24:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592056623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:46,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:46,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:24:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906412974] [2023-08-31 23:24:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:46,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:46,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 271 [2023-08-31 23:24:46,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:46,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:46,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 271 [2023-08-31 23:24:46,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:49,032 INFO L130 PetriNetUnfolder]: 21112/28468 cut-off events. [2023-08-31 23:24:49,032 INFO L131 PetriNetUnfolder]: For 11405/11405 co-relation queries the response was YES. [2023-08-31 23:24:49,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72020 conditions, 28468 events. 21112/28468 cut-off events. For 11405/11405 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 152166 event pairs, 1907 based on Foata normal form. 40/28508 useless extension candidates. Maximal degree in co-relation 72015. Up to 14713 conditions per place. [2023-08-31 23:24:49,211 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 61 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2023-08-31 23:24:49,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 386 flow [2023-08-31 23:24:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:24:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:24:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-31 23:24:49,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169741697416974 [2023-08-31 23:24:49,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-31 23:24:49,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-31 23:24:49,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:49,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-31 23:24:49,220 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:24:49,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:24:49,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:24:49,223 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 4 states and 533 transitions. [2023-08-31 23:24:49,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 386 flow [2023-08-31 23:24:49,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:24:49,270 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 206 flow [2023-08-31 23:24:49,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-31 23:24:49,272 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-31 23:24:49,272 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 206 flow [2023-08-31 23:24:49,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:49,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:49,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:49,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:24:49,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:49,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 205860706, now seen corresponding path program 1 times [2023-08-31 23:24:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542461227] [2023-08-31 23:24:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:49,460 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:24:49,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542461227] [2023-08-31 23:24:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542461227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:49,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:49,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:24:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154863619] [2023-08-31 23:24:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:24:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:24:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:24:49,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2023-08-31 23:24:49,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 206 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:24:49,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:49,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2023-08-31 23:24:49,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:51,649 INFO L130 PetriNetUnfolder]: 18664/25815 cut-off events. [2023-08-31 23:24:51,650 INFO L131 PetriNetUnfolder]: For 20314/20562 co-relation queries the response was YES. [2023-08-31 23:24:51,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68215 conditions, 25815 events. 18664/25815 cut-off events. For 20314/20562 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 147104 event pairs, 8546 based on Foata normal form. 190/25817 useless extension candidates. Maximal degree in co-relation 68208. Up to 23515 conditions per place. [2023-08-31 23:24:51,831 INFO L137 encePairwiseOnDemand]: 267/271 looper letters, 57 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2023-08-31 23:24:51,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 438 flow [2023-08-31 23:24:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-31 23:24:51,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092250922509225 [2023-08-31 23:24:51,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-31 23:24:51,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-31 23:24:51,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:51,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-31 23:24:51,836 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:24:51,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:51,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:51,838 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 206 flow. Second operand 3 states and 414 transitions. [2023-08-31 23:24:51,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 438 flow [2023-08-31 23:24:51,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:24:51,892 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 266 flow [2023-08-31 23:24:51,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2023-08-31 23:24:51,895 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-31 23:24:51,895 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 266 flow [2023-08-31 23:24:51,895 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:24:51,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:51,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:51,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:24:51,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:51,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 205862943, now seen corresponding path program 1 times [2023-08-31 23:24:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270940363] [2023-08-31 23:24:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:52,480 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:24:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:52,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270940363] [2023-08-31 23:24:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270940363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:52,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:52,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:24:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257958529] [2023-08-31 23:24:52,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:52,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:24:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:24:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:24:52,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 271 [2023-08-31 23:24:52,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:52,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:52,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 271 [2023-08-31 23:24:52,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:54,683 INFO L130 PetriNetUnfolder]: 14128/19697 cut-off events. [2023-08-31 23:24:54,683 INFO L131 PetriNetUnfolder]: For 20545/21630 co-relation queries the response was YES. [2023-08-31 23:24:54,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54808 conditions, 19697 events. 14128/19697 cut-off events. For 20545/21630 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 112810 event pairs, 4109 based on Foata normal form. 1413/20639 useless extension candidates. Maximal degree in co-relation 54799. Up to 13550 conditions per place. [2023-08-31 23:24:54,818 INFO L137 encePairwiseOnDemand]: 265/271 looper letters, 51 selfloop transitions, 4 changer transitions 25/92 dead transitions. [2023-08-31 23:24:54,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 624 flow [2023-08-31 23:24:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:24:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:24:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-08-31 23:24:54,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4248813916710596 [2023-08-31 23:24:54,825 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-08-31 23:24:54,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-08-31 23:24:54,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:54,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-08-31 23:24:54,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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:24:54,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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:24:54,836 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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:24:54,836 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 266 flow. Second operand 7 states and 806 transitions. [2023-08-31 23:24:54,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 624 flow [2023-08-31 23:24:54,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:24:54,889 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 248 flow [2023-08-31 23:24:54,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=7, PETRI_FLOW=248, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-31 23:24:54,892 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-31 23:24:54,892 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 248 flow [2023-08-31 23:24:54,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:24:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:54,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:24:54,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:24:54,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:54,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 87252896, now seen corresponding path program 1 times [2023-08-31 23:24:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:54,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596076654] [2023-08-31 23:24:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:55,131 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:24:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596076654] [2023-08-31 23:24:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596076654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:24:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899912633] [2023-08-31 23:24:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:55,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:24:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:24:55,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:24:55,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-31 23:24:55,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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:24:55,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:55,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-31 23:24:55,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:56,520 INFO L130 PetriNetUnfolder]: 8683/12753 cut-off events. [2023-08-31 23:24:56,520 INFO L131 PetriNetUnfolder]: For 13018/13772 co-relation queries the response was YES. [2023-08-31 23:24:56,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33529 conditions, 12753 events. 8683/12753 cut-off events. For 13018/13772 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 77698 event pairs, 1433 based on Foata normal form. 1143/13653 useless extension candidates. Maximal degree in co-relation 33520. Up to 8038 conditions per place. [2023-08-31 23:24:56,605 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 94 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2023-08-31 23:24:56,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 116 transitions, 796 flow [2023-08-31 23:24:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:24:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:24:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-31 23:24:56,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922509225092251 [2023-08-31 23:24:56,609 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-31 23:24:56,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-31 23:24:56,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:56,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-31 23:24:56,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:24:56,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states 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:24:56,614 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states 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:24:56,614 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 248 flow. Second operand 5 states and 667 transitions. [2023-08-31 23:24:56,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 116 transitions, 796 flow [2023-08-31 23:24:56,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 116 transitions, 784 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:24:56,630 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 316 flow [2023-08-31 23:24:56,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2023-08-31 23:24:56,631 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-31 23:24:56,631 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 316 flow [2023-08-31 23:24:56,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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:24:56,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:56,632 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:24:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:24:56,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:56,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2038249608, now seen corresponding path program 1 times [2023-08-31 23:24:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142668808] [2023-08-31 23:24:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:56,834 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:24:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142668808] [2023-08-31 23:24:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142668808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:56,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:24:56,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751957470] [2023-08-31 23:24:56,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:56,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:24:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:24:56,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:24:56,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2023-08-31 23:24:56,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:24:56,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:56,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2023-08-31 23:24:56,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:24:58,608 INFO L130 PetriNetUnfolder]: 12942/19032 cut-off events. [2023-08-31 23:24:58,608 INFO L131 PetriNetUnfolder]: For 27272/27568 co-relation queries the response was YES. [2023-08-31 23:24:58,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63334 conditions, 19032 events. 12942/19032 cut-off events. For 27272/27568 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 121582 event pairs, 6200 based on Foata normal form. 364/19120 useless extension candidates. Maximal degree in co-relation 63322. Up to 9855 conditions per place. [2023-08-31 23:24:58,710 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 64 selfloop transitions, 7 changer transitions 9/86 dead transitions. [2023-08-31 23:24:58,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 629 flow [2023-08-31 23:24:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:24:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:24:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-31 23:24:58,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067650676506765 [2023-08-31 23:24:58,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-31 23:24:58,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-31 23:24:58,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:24:58,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-31 23:24:58,715 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:24:58,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:58,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:24:58,717 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 316 flow. Second operand 3 states and 412 transitions. [2023-08-31 23:24:58,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 629 flow [2023-08-31 23:24:58,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:24:58,771 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 310 flow [2023-08-31 23:24:58,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-31 23:24:58,772 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-31 23:24:58,772 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 310 flow [2023-08-31 23:24:58,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:24:58,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:24:58,773 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:24:58,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:24:58,773 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:24:58,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:24:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1080191955, now seen corresponding path program 1 times [2023-08-31 23:24:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:24:58,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493283060] [2023-08-31 23:24:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:24:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:24:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:24:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:24:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:24:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493283060] [2023-08-31 23:24:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493283060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:24:59,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:24:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:24:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641604220] [2023-08-31 23:24:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:24:59,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:24:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:24:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:24:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:24:59,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-31 23:24:59,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 310 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:24:59,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:24:59,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-31 23:24:59,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:00,147 INFO L130 PetriNetUnfolder]: 8501/12977 cut-off events. [2023-08-31 23:25:00,147 INFO L131 PetriNetUnfolder]: For 18544/19084 co-relation queries the response was YES. [2023-08-31 23:25:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42317 conditions, 12977 events. 8501/12977 cut-off events. For 18544/19084 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 85798 event pairs, 954 based on Foata normal form. 1033/13733 useless extension candidates. Maximal degree in co-relation 42304. Up to 4410 conditions per place. [2023-08-31 23:25:00,227 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 127 selfloop transitions, 17 changer transitions 1/155 dead transitions. [2023-08-31 23:25:00,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 155 transitions, 1193 flow [2023-08-31 23:25:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:25:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:25:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-08-31 23:25:00,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49235635213494994 [2023-08-31 23:25:00,231 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-08-31 23:25:00,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-08-31 23:25:00,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:00,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-08-31 23:25:00,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 0 states have call successors, (0), 0 states 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:25:00,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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:25:00,237 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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:25:00,238 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 310 flow. Second operand 7 states and 934 transitions. [2023-08-31 23:25:00,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 155 transitions, 1193 flow [2023-08-31 23:25:00,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 155 transitions, 1102 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:00,317 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 414 flow [2023-08-31 23:25:00,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-08-31 23:25:00,318 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-31 23:25:00,318 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 414 flow [2023-08-31 23:25:00,319 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:25:00,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:00,319 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:25:00,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:25:00,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:00,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:00,320 INFO L85 PathProgramCache]: Analyzing trace with hash -662842324, now seen corresponding path program 1 times [2023-08-31 23:25:00,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842185254] [2023-08-31 23:25:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:00,528 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:25:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842185254] [2023-08-31 23:25:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842185254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41773454] [2023-08-31 23:25:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:00,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:00,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2023-08-31 23:25:00,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:00,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:00,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2023-08-31 23:25:00,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:02,140 INFO L130 PetriNetUnfolder]: 12560/19107 cut-off events. [2023-08-31 23:25:02,140 INFO L131 PetriNetUnfolder]: For 43912/44174 co-relation queries the response was YES. [2023-08-31 23:25:02,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73479 conditions, 19107 events. 12560/19107 cut-off events. For 43912/44174 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 130384 event pairs, 4529 based on Foata normal form. 238/18977 useless extension candidates. Maximal degree in co-relation 73463. Up to 9533 conditions per place. [2023-08-31 23:25:02,272 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 69 selfloop transitions, 6 changer transitions 12/93 dead transitions. [2023-08-31 23:25:02,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 831 flow [2023-08-31 23:25:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-31 23:25:02,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018450184501845 [2023-08-31 23:25:02,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-31 23:25:02,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-31 23:25:02,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:02,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-31 23:25:02,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:02,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:25:02,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states 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:25:02,278 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 414 flow. Second operand 3 states and 408 transitions. [2023-08-31 23:25:02,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 831 flow [2023-08-31 23:25:03,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 737 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-31 23:25:03,374 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 370 flow [2023-08-31 23:25:03,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2023-08-31 23:25:03,375 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-31 23:25:03,375 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 370 flow [2023-08-31 23:25:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:03,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:03,376 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:25:03,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:25:03,376 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:03,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1305346602, now seen corresponding path program 1 times [2023-08-31 23:25:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577665870] [2023-08-31 23:25:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:03,672 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:25:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577665870] [2023-08-31 23:25:03,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577665870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:25:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777746789] [2023-08-31 23:25:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:03,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:25:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:25:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:25:03,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-31 23:25:03,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:03,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:03,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-31 23:25:03,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:04,965 INFO L130 PetriNetUnfolder]: 9145/13955 cut-off events. [2023-08-31 23:25:04,966 INFO L131 PetriNetUnfolder]: For 21816/22345 co-relation queries the response was YES. [2023-08-31 23:25:05,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47446 conditions, 13955 events. 9145/13955 cut-off events. For 21816/22345 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 93923 event pairs, 980 based on Foata normal form. 678/14328 useless extension candidates. Maximal degree in co-relation 47429. Up to 3117 conditions per place. [2023-08-31 23:25:05,046 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 135 selfloop transitions, 23 changer transitions 20/188 dead transitions. [2023-08-31 23:25:05,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 188 transitions, 1453 flow [2023-08-31 23:25:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:25:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:25:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1199 transitions. [2023-08-31 23:25:05,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915949159491595 [2023-08-31 23:25:05,050 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1199 transitions. [2023-08-31 23:25:05,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1199 transitions. [2023-08-31 23:25:05,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:05,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1199 transitions. [2023-08-31 23:25:05,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.22222222222223) internal successors, (1199), 9 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states 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:25:05,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:25:05,057 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:25:05,057 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 370 flow. Second operand 9 states and 1199 transitions. [2023-08-31 23:25:05,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 188 transitions, 1453 flow [2023-08-31 23:25:05,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1415 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:05,430 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 518 flow [2023-08-31 23:25:05,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2023-08-31 23:25:05,431 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-31 23:25:05,431 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 518 flow [2023-08-31 23:25:05,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:05,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:05,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:05,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:25:05,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:05,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1784574930, now seen corresponding path program 1 times [2023-08-31 23:25:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185821201] [2023-08-31 23:25:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:06,167 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:25:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185821201] [2023-08-31 23:25:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185821201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:06,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:25:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472023373] [2023-08-31 23:25:06,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:06,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:25:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:06,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:25:06,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:25:06,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 271 [2023-08-31 23:25:06,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 518 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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:25:06,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:06,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 271 [2023-08-31 23:25:06,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:08,848 INFO L130 PetriNetUnfolder]: 18236/27829 cut-off events. [2023-08-31 23:25:08,848 INFO L131 PetriNetUnfolder]: For 89700/89700 co-relation queries the response was YES. [2023-08-31 23:25:08,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113256 conditions, 27829 events. 18236/27829 cut-off events. For 89700/89700 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 197674 event pairs, 883 based on Foata normal form. 11/27840 useless extension candidates. Maximal degree in co-relation 113237. Up to 6622 conditions per place. [2023-08-31 23:25:08,956 INFO L137 encePairwiseOnDemand]: 259/271 looper letters, 186 selfloop transitions, 48 changer transitions 104/338 dead transitions. [2023-08-31 23:25:08,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 338 transitions, 3345 flow [2023-08-31 23:25:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:25:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:25:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1174 transitions. [2023-08-31 23:25:08,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48134481344813446 [2023-08-31 23:25:08,959 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1174 transitions. [2023-08-31 23:25:08,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1174 transitions. [2023-08-31 23:25:08,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:08,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1174 transitions. [2023-08-31 23:25:08,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.44444444444446) internal successors, (1174), 9 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states 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:25:08,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:25:08,966 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:25:08,966 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 518 flow. Second operand 9 states and 1174 transitions. [2023-08-31 23:25:08,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 338 transitions, 3345 flow [2023-08-31 23:25:11,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 338 transitions, 2792 flow, removed 208 selfloop flow, removed 3 redundant places. [2023-08-31 23:25:11,755 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 793 flow [2023-08-31 23:25:11,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2023-08-31 23:25:11,756 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-08-31 23:25:11,756 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 793 flow [2023-08-31 23:25:11,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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:25:11,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:11,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:11,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:25:11,757 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:11,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -289105474, now seen corresponding path program 2 times [2023-08-31 23:25:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749281183] [2023-08-31 23:25:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:12,209 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:25:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749281183] [2023-08-31 23:25:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749281183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:12,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:12,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:25:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735800308] [2023-08-31 23:25:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:12,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:25:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:25:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:25:12,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 271 [2023-08-31 23:25:12,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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:25:12,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:12,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 271 [2023-08-31 23:25:12,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:13,730 INFO L130 PetriNetUnfolder]: 7519/11823 cut-off events. [2023-08-31 23:25:13,730 INFO L131 PetriNetUnfolder]: For 34403/34403 co-relation queries the response was YES. [2023-08-31 23:25:13,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49506 conditions, 11823 events. 7519/11823 cut-off events. For 34403/34403 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 75837 event pairs, 1133 based on Foata normal form. 11/11834 useless extension candidates. Maximal degree in co-relation 49481. Up to 4983 conditions per place. [2023-08-31 23:25:13,823 INFO L137 encePairwiseOnDemand]: 257/271 looper letters, 146 selfloop transitions, 58 changer transitions 78/282 dead transitions. [2023-08-31 23:25:13,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 282 transitions, 2666 flow [2023-08-31 23:25:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:25:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:25:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1164 transitions. [2023-08-31 23:25:13,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47724477244772445 [2023-08-31 23:25:13,827 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1164 transitions. [2023-08-31 23:25:13,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1164 transitions. [2023-08-31 23:25:13,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:13,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1164 transitions. [2023-08-31 23:25:13,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.33333333333334) internal successors, (1164), 9 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states 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:25:13,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:25:13,833 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:25:13,833 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 793 flow. Second operand 9 states and 1164 transitions. [2023-08-31 23:25:13,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 282 transitions, 2666 flow [2023-08-31 23:25:14,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 282 transitions, 2499 flow, removed 76 selfloop flow, removed 5 redundant places. [2023-08-31 23:25:14,169 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 1055 flow [2023-08-31 23:25:14,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1055, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2023-08-31 23:25:14,170 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-08-31 23:25:14,170 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 1055 flow [2023-08-31 23:25:14,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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:25:14,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:14,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:25:14,171 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:14,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1994241572, now seen corresponding path program 3 times [2023-08-31 23:25:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:14,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552531995] [2023-08-31 23:25:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:14,447 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:25:14,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552531995] [2023-08-31 23:25:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552531995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:25:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643301183] [2023-08-31 23:25:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:14,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:25:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:25:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:25:14,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-31 23:25:14,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 1055 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states 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:25:14,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:14,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-31 23:25:14,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:15,308 INFO L130 PetriNetUnfolder]: 4881/7818 cut-off events. [2023-08-31 23:25:15,308 INFO L131 PetriNetUnfolder]: For 28230/28699 co-relation queries the response was YES. [2023-08-31 23:25:15,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35307 conditions, 7818 events. 4881/7818 cut-off events. For 28230/28699 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51379 event pairs, 509 based on Foata normal form. 409/8075 useless extension candidates. Maximal degree in co-relation 35280. Up to 3159 conditions per place. [2023-08-31 23:25:15,361 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 164 selfloop transitions, 18 changer transitions 78/273 dead transitions. [2023-08-31 23:25:15,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 273 transitions, 3001 flow [2023-08-31 23:25:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:25:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:25:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2023-08-31 23:25:15,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48108856088560886 [2023-08-31 23:25:15,364 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1043 transitions. [2023-08-31 23:25:15,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1043 transitions. [2023-08-31 23:25:15,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:15,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1043 transitions. [2023-08-31 23:25:15,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states 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:25:15,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states 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:25:15,370 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states 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:25:15,370 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 1055 flow. Second operand 8 states and 1043 transitions. [2023-08-31 23:25:15,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 273 transitions, 3001 flow [2023-08-31 23:25:15,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 273 transitions, 2864 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-08-31 23:25:15,668 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 843 flow [2023-08-31 23:25:15,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=843, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-31 23:25:15,669 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-31 23:25:15,669 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 843 flow [2023-08-31 23:25:15,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states 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:25:15,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:15,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:15,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:25:15,670 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:15,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2083845180, now seen corresponding path program 1 times [2023-08-31 23:25:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:15,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591094530] [2023-08-31 23:25:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:15,926 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:25:15,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:15,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591094530] [2023-08-31 23:25:15,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591094530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:15,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:15,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:25:15,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969356209] [2023-08-31 23:25:15,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:15,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:25:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:25:15,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:25:15,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 271 [2023-08-31 23:25:15,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 843 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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:25:15,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:15,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 271 [2023-08-31 23:25:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:16,444 INFO L130 PetriNetUnfolder]: 2272/3519 cut-off events. [2023-08-31 23:25:16,444 INFO L131 PetriNetUnfolder]: For 13814/13814 co-relation queries the response was YES. [2023-08-31 23:25:16,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17320 conditions, 3519 events. 2272/3519 cut-off events. For 13814/13814 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17456 event pairs, 129 based on Foata normal form. 1/3520 useless extension candidates. Maximal degree in co-relation 17293. Up to 1474 conditions per place. [2023-08-31 23:25:16,464 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 79 selfloop transitions, 13 changer transitions 92/184 dead transitions. [2023-08-31 23:25:16,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 184 transitions, 1977 flow [2023-08-31 23:25:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:25:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:25:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 762 transitions. [2023-08-31 23:25:16,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46863468634686345 [2023-08-31 23:25:16,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 762 transitions. [2023-08-31 23:25:16,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 762 transitions. [2023-08-31 23:25:16,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:16,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 762 transitions. [2023-08-31 23:25:16,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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:25:16,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states 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:25:16,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states 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:25:16,472 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 843 flow. Second operand 6 states and 762 transitions. [2023-08-31 23:25:16,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 184 transitions, 1977 flow [2023-08-31 23:25:16,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 184 transitions, 1765 flow, removed 41 selfloop flow, removed 11 redundant places. [2023-08-31 23:25:16,518 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 514 flow [2023-08-31 23:25:16,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2023-08-31 23:25:16,518 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-31 23:25:16,519 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 514 flow [2023-08-31 23:25:16,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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:25:16,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:16,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:16,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:25:16,519 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:16,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:16,519 INFO L85 PathProgramCache]: Analyzing trace with hash -645371094, now seen corresponding path program 2 times [2023-08-31 23:25:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566540364] [2023-08-31 23:25:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:25:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:25:17,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566540364] [2023-08-31 23:25:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566540364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:17,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:17,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:25:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058402558] [2023-08-31 23:25:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:17,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:25:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:25:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:25:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:25:17,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-31 23:25:17,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 514 flow. Second operand has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:25:17,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:17,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-31 23:25:17,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:17,694 INFO L130 PetriNetUnfolder]: 643/1077 cut-off events. [2023-08-31 23:25:17,694 INFO L131 PetriNetUnfolder]: For 3331/3331 co-relation queries the response was YES. [2023-08-31 23:25:17,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 1077 events. 643/1077 cut-off events. For 3331/3331 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4449 event pairs, 104 based on Foata normal form. 1/1071 useless extension candidates. Maximal degree in co-relation 4677. Up to 671 conditions per place. [2023-08-31 23:25:17,698 INFO L137 encePairwiseOnDemand]: 265/271 looper letters, 59 selfloop transitions, 5 changer transitions 43/111 dead transitions. [2023-08-31 23:25:17,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 974 flow [2023-08-31 23:25:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:25:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:25:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-08-31 23:25:17,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681075382182393 [2023-08-31 23:25:17,703 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-08-31 23:25:17,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-08-31 23:25:17,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:17,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-08-31 23:25:17,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:17,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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:25:17,708 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states 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:25:17,708 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 514 flow. Second operand 7 states and 888 transitions. [2023-08-31 23:25:17,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 974 flow [2023-08-31 23:25:17,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 866 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-31 23:25:17,719 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 322 flow [2023-08-31 23:25:17,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2023-08-31 23:25:17,719 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2023-08-31 23:25:17,719 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 322 flow [2023-08-31 23:25:17,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:25:17,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:17,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:17,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:25:17,721 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:17,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash 230194992, now seen corresponding path program 3 times [2023-08-31 23:25:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:25:17,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144304030] [2023-08-31 23:25:17,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:17,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:25:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:25:17,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:25:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:25:17,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:25:17,830 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:25:17,830 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:25:17,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:25:17,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:25:17,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:25:17,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:25:17,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:25:17,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:25:17,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:25:17,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:25:17,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:25:17,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:25:17,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:25:17,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:25:17,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:25:17,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:25:17,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:25:17,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:25:17,836 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:17,841 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:25:17,841 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:25:17,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:25:17 BasicIcfg [2023-08-31 23:25:17,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:25:17,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:25:17,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:25:17,913 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:25:17,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:24:34" (3/4) ... [2023-08-31 23:25:17,915 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:25:17,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:25:17,916 INFO L158 Benchmark]: Toolchain (without parser) took 44378.76ms. Allocated memory was 73.4MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 49.1MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2023-08-31 23:25:17,916 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:17,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.61ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 48.9MB in the beginning and 60.1MB in the end (delta: -11.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-08-31 23:25:17,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.60ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:25:17,917 INFO L158 Benchmark]: Boogie Preprocessor took 51.08ms. Allocated memory is still 90.2MB. Free memory was 57.7MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:25:17,917 INFO L158 Benchmark]: RCFGBuilder took 766.13ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 64.9MB in the end (delta: -9.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-31 23:25:17,918 INFO L158 Benchmark]: TraceAbstraction took 42932.40ms. Allocated memory was 90.2MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 64.3MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2023-08-31 23:25:17,918 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 5.7GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:17,919 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.61ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 48.9MB in the beginning and 60.1MB in the end (delta: -11.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.60ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 57.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.08ms. Allocated memory is still 90.2MB. Free memory was 57.7MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.13ms. Allocated memory is still 90.2MB. Free memory was 55.5MB in the beginning and 64.9MB in the end (delta: -9.4MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 42932.40ms. Allocated memory was 90.2MB in the beginning and 5.7GB in the end (delta: 5.7GB). Free memory was 64.3MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 5.7GB. Free memory was 2.8GB in the beginning and 2.8GB 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: 4.8s, 147 PlacesBefore, 52 PlacesAfterwards, 136 TransitionsBefore, 40 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 9977 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4488, independent: 4252, independent conditional: 0, independent unconditional: 4252, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1780, independent conditional: 0, independent unconditional: 1780, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4488, independent: 2472, independent conditional: 0, independent unconditional: 2472, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1828, unknown conditional: 0, unknown unconditional: 1828] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-3, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-2, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1460; [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1067 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2790 IncrementalHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 69 mSDtfsCounter, 2790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1055occurred in iteration=13, InterpolantAutomatonStates: 88, 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.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:25:17,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/mix055_power.oepc_pso.oepc_rmo.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 b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --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:25:20,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:25:20,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:25:20,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:25:20,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:25:20,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:25:20,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:25:20,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:25:20,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:25:20,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:25:20,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:25:20,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:25:20,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:25:20,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:25:20,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:25:20,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:25:20,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:25:20,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:25:20,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:25:20,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:25:20,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:25:20,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:25:20,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:25:20,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:25:20,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:25:20,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:25:20,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:25:20,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:25:20,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:25:20,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:25:20,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:25:20,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:25:20,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:25:20,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:25:20,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:25:20,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:25:20,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:25:20,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:25:20,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:25:20,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:25:20,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:25:20,285 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:25:20,317 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:25:20,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:25:20,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:25:20,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:25:20,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:25:20,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:25:20,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:25:20,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:25:20,320 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:25:20,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:25:20,321 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:25:20,322 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:25:20,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:25:20,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:25:20,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:25:20,322 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:25:20,323 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:25:20,323 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:25:20,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:25:20,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:25:20,323 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:25:20,323 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:25:20,324 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:25:20,324 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:25:20,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:25:20,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:25:20,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:25:20,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:20,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:25:20,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:25:20,325 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:25:20,325 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:25:20,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:25:20,326 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:25:20,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:25:20,326 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:25:20,326 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:25:20,327 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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 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:25:20,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:25:20,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:25:20,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:25:20,648 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:25:20,648 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:25:20,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:21,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:25:21,980 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:25:21,980 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:21,993 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4820be632/fdd87df2d16e4fb58aeb1324a47fdaac/FLAGec12d7f36 [2023-08-31 23:25:22,006 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4820be632/fdd87df2d16e4fb58aeb1324a47fdaac [2023-08-31 23:25:22,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:25:22,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:25:22,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:22,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:25:22,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:25:22,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46591c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22, skipping insertion in model container [2023-08-31 23:25:22,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:25:22,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:25:22,187 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:25:22,394 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:22,415 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:25:22,427 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:25:22,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:25:22,535 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:22,535 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:25:22,541 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:25:22,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22 WrapperNode [2023-08-31 23:25:22,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:25:22,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:22,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:25:22,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:25:22,549 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:25:22" (1/1) ... [2023-08-31 23:25:22,581 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:25:22" (1/1) ... [2023-08-31 23:25:22,616 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-31 23:25:22,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:25:22,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:25:22,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:25:22,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:25:22,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,668 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:25:22,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:25:22,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:25:22,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:25:22,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (1/1) ... [2023-08-31 23:25:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:25:22,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:25:22,718 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:25:22,734 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:25:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:25:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:25:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:25:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:25:22,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:25:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:25:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:25:22,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:25:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:25:22,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:25:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:25:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:25:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:25:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:25:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:25:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:25:22,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:25:22,764 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:25:22,937 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:25:22,942 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:25:23,345 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:25:23,468 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:25:23,468 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:25:23,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:23 BoogieIcfgContainer [2023-08-31 23:25:23,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:25:23,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:25:23,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:25:23,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:25:23,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:25:22" (1/3) ... [2023-08-31 23:25:23,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15c2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:23, skipping insertion in model container [2023-08-31 23:25:23,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:25:22" (2/3) ... [2023-08-31 23:25:23,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15c2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:25:23, skipping insertion in model container [2023-08-31 23:25:23,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:23" (3/3) ... [2023-08-31 23:25:23,478 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:25:23,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:25:23,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:25:23,492 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:25:23,575 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:25:23,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-31 23:25:23,683 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-31 23:25:23,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:23,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:25:23,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-31 23:25:23,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-31 23:25:23,703 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:25:23,723 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-31 23:25:23,727 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-31 23:25:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-31 23:25:23,771 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-31 23:25:23,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:23,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-31 23:25:23,779 INFO L119 LiptonReduction]: Number of co-enabled transitions 3412 [2023-08-31 23:25:30,591 INFO L134 LiptonReduction]: Checked pairs total: 9228 [2023-08-31 23:25:30,591 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-31 23:25:30,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:25:30,616 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;@4f97c88f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:25:30,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:25:30,618 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:25:30,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:30,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:30,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:25:30,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:30,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2023-08-31 23:25:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946330656] [2023-08-31 23:25:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:30,634 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:25:30,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:30,636 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:25:30,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:25:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:30,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:25:30,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:30,705 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:25:30,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:30,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946330656] [2023-08-31 23:25:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946330656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:25:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416085271] [2023-08-31 23:25:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:30,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:25:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:25:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:25:30,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 275 [2023-08-31 23:25:30,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:25:30,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:30,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 275 [2023-08-31 23:25:30,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:32,317 INFO L130 PetriNetUnfolder]: 8719/11751 cut-off events. [2023-08-31 23:25:32,318 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-31 23:25:32,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23699 conditions, 11751 events. 8719/11751 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 59448 event pairs, 8719 based on Foata normal form. 0/10324 useless extension candidates. Maximal degree in co-relation 23687. Up to 11731 conditions per place. [2023-08-31 23:25:32,384 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 28 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-31 23:25:32,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 130 flow [2023-08-31 23:25:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:25:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:25:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-31 23:25:32,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254545454545455 [2023-08-31 23:25:32,397 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-31 23:25:32,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-31 23:25:32,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:32,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-31 23:25:32,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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:25:32,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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:25:32,406 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states 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:25:32,408 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 289 transitions. [2023-08-31 23:25:32,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 130 flow [2023-08-31 23:25:32,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:25:32,415 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-31 23:25:32,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:25:32,419 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-31 23:25:32,419 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-31 23:25:32,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:25:32,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:32,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:25:32,429 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:25:32,628 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:25:32,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:32,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 591409, now seen corresponding path program 1 times [2023-08-31 23:25:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:32,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123332768] [2023-08-31 23:25:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:32,630 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:25:32,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:32,632 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:25:32,635 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:25:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:32,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:25:32,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:32,726 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:25:32,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:32,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123332768] [2023-08-31 23:25:32,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123332768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:32,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:32,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:25:32,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752228545] [2023-08-31 23:25:32,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:32,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:32,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:32,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:32,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:32,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-31 23:25:32,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 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:25:32,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:32,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-31 23:25:32,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:33,788 INFO L130 PetriNetUnfolder]: 6855/9870 cut-off events. [2023-08-31 23:25:33,788 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:25:33,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19307 conditions, 9870 events. 6855/9870 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 59449 event pairs, 1263 based on Foata normal form. 0/9225 useless extension candidates. Maximal degree in co-relation 19304. Up to 7399 conditions per place. [2023-08-31 23:25:33,844 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-31 23:25:33,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 216 flow [2023-08-31 23:25:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-31 23:25:33,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-31 23:25:33,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-31 23:25:33,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-31 23:25:33,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:33,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-31 23:25:33,850 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:25:33,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:25:33,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:25:33,853 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 425 transitions. [2023-08-31 23:25:33,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 216 flow [2023-08-31 23:25:33,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:25:33,855 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-31 23:25:33,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-31 23:25:33,856 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-31 23:25:33,856 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-31 23:25:33,857 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:25:33,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:33,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:33,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:25:34,066 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:25:34,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:34,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:34,067 INFO L85 PathProgramCache]: Analyzing trace with hash -800685654, now seen corresponding path program 1 times [2023-08-31 23:25:34,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528839985] [2023-08-31 23:25:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:34,068 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:25:34,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:34,070 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:25:34,072 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:25:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:34,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:25:34,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:34,204 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:25:34,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:34,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:34,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528839985] [2023-08-31 23:25:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528839985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:34,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:34,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:25:34,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327446244] [2023-08-31 23:25:34,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:34,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:34,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-31 23:25:34,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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:25:34,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:34,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-31 23:25:34,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:34,941 INFO L130 PetriNetUnfolder]: 4483/6366 cut-off events. [2023-08-31 23:25:34,941 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-31 23:25:34,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13315 conditions, 6366 events. 4483/6366 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 33592 event pairs, 818 based on Foata normal form. 320/6460 useless extension candidates. Maximal degree in co-relation 13311. Up to 4756 conditions per place. [2023-08-31 23:25:34,976 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 40 selfloop transitions, 5 changer transitions 27/75 dead transitions. [2023-08-31 23:25:34,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 318 flow [2023-08-31 23:25:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:25:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:25:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-31 23:25:34,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49018181818181816 [2023-08-31 23:25:34,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-31 23:25:34,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-31 23:25:34,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:34,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-31 23:25:34,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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:25:34,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states 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:25:34,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states 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:25:34,986 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 674 transitions. [2023-08-31 23:25:34,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 318 flow [2023-08-31 23:25:34,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:34,988 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-08-31 23:25:34,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-31 23:25:34,989 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-31 23:25:34,990 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-08-31 23:25:34,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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:25:34,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:34,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:35,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:25:35,208 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:25:35,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:35,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2122229227, now seen corresponding path program 1 times [2023-08-31 23:25:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972642100] [2023-08-31 23:25:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:35,211 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:25:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:35,212 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:25:35,214 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:25:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:35,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:25:35,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:35,354 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:25:35,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:35,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972642100] [2023-08-31 23:25:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972642100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:35,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:35,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:25:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626236699] [2023-08-31 23:25:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:35,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:25:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:25:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:25:35,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-31 23:25:35,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:35,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:35,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-31 23:25:35,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:35,931 INFO L130 PetriNetUnfolder]: 2161/3261 cut-off events. [2023-08-31 23:25:35,931 INFO L131 PetriNetUnfolder]: For 1191/1191 co-relation queries the response was YES. [2023-08-31 23:25:35,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8656 conditions, 3261 events. 2161/3261 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16680 event pairs, 403 based on Foata normal form. 212/3382 useless extension candidates. Maximal degree in co-relation 8649. Up to 1426 conditions per place. [2023-08-31 23:25:35,949 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 53 selfloop transitions, 9 changer transitions 27/92 dead transitions. [2023-08-31 23:25:35,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 467 flow [2023-08-31 23:25:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:25:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:25:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2023-08-31 23:25:35,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915151515151515 [2023-08-31 23:25:35,953 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2023-08-31 23:25:35,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2023-08-31 23:25:35,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:35,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2023-08-31 23:25:35,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:25:35,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states 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:25:35,960 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states 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:25:35,960 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 811 transitions. [2023-08-31 23:25:35,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 467 flow [2023-08-31 23:25:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 460 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:25:35,969 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-08-31 23:25:35,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-31 23:25:35,970 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-31 23:25:35,970 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-08-31 23:25:35,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:35,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:35,971 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:25:35,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:25:36,180 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:25:36,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:36,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2117794971, now seen corresponding path program 1 times [2023-08-31 23:25:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:36,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55973545] [2023-08-31 23:25:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:36,183 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:25:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:36,184 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:25:36,185 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:25:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:36,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:25:36,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:36,349 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:25:36,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:36,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:36,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55973545] [2023-08-31 23:25:36,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55973545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:36,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:36,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:25:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310288932] [2023-08-31 23:25:36,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:36,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:25:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:25:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:25:36,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-31 23:25:36,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:25:36,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:36,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-31 23:25:36,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:36,859 INFO L130 PetriNetUnfolder]: 1189/1839 cut-off events. [2023-08-31 23:25:36,859 INFO L131 PetriNetUnfolder]: For 1810/1810 co-relation queries the response was YES. [2023-08-31 23:25:36,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5559 conditions, 1839 events. 1189/1839 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8758 event pairs, 331 based on Foata normal form. 77/1888 useless extension candidates. Maximal degree in co-relation 5550. Up to 630 conditions per place. [2023-08-31 23:25:36,869 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 64 selfloop transitions, 13 changer transitions 27/107 dead transitions. [2023-08-31 23:25:36,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 107 transitions, 636 flow [2023-08-31 23:25:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:25:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:25:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-08-31 23:25:36,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-31 23:25:36,872 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-08-31 23:25:36,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-08-31 23:25:36,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:36,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-08-31 23:25:36,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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:25:36,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:25:36,879 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:25:36,879 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 946 transitions. [2023-08-31 23:25:36,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 107 transitions, 636 flow [2023-08-31 23:25:36,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 574 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:25:36,892 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-08-31 23:25:36,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-31 23:25:36,893 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-31 23:25:36,893 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-08-31 23:25:36,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:25:36,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:36,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:36,907 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:25:37,103 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:25:37,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:37,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash 11072410, now seen corresponding path program 1 times [2023-08-31 23:25:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935780941] [2023-08-31 23:25:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:37,105 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:25:37,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:37,106 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:25:37,108 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:25:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:37,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:25:37,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:37,281 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:25:37,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:37,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935780941] [2023-08-31 23:25:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935780941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:37,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:25:37,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106443816] [2023-08-31 23:25:37,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:37,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:25:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:25:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:25:37,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-31 23:25:37,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:25:37,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:37,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-31 23:25:37,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:37,785 INFO L130 PetriNetUnfolder]: 1011/1533 cut-off events. [2023-08-31 23:25:37,785 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2023-08-31 23:25:37,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 1533 events. 1011/1533 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7116 event pairs, 326 based on Foata normal form. 14/1532 useless extension candidates. Maximal degree in co-relation 4475. Up to 630 conditions per place. [2023-08-31 23:25:37,793 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 60 selfloop transitions, 17 changer transitions 14/94 dead transitions. [2023-08-31 23:25:37,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 572 flow [2023-08-31 23:25:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:25:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:25:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1053 transitions. [2023-08-31 23:25:37,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863636363636364 [2023-08-31 23:25:37,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1053 transitions. [2023-08-31 23:25:37,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1053 transitions. [2023-08-31 23:25:37,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:37,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1053 transitions. [2023-08-31 23:25:37,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.625) internal successors, (1053), 8 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:25:37,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states 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:25:37,803 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states 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:25:37,803 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1053 transitions. [2023-08-31 23:25:37,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 572 flow [2023-08-31 23:25:37,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 510 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:25:37,818 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-08-31 23:25:37,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-31 23:25:37,818 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-31 23:25:37,819 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-08-31 23:25:37,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:25:37,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:37,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:37,831 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:25:38,028 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:25:38,029 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:38,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1831735470, now seen corresponding path program 1 times [2023-08-31 23:25:38,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:38,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127199192] [2023-08-31 23:25:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:25:38,030 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:25:38,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:38,031 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:25:38,034 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:25:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:25:38,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:25:38,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:38,574 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:25:38,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:38,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127199192] [2023-08-31 23:25:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127199192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:38,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:25:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499797237] [2023-08-31 23:25:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:38,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:25:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:25:38,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:25:38,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-31 23:25:38,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:25:38,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:38,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-31 23:25:38,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:39,027 INFO L130 PetriNetUnfolder]: 1159/1879 cut-off events. [2023-08-31 23:25:39,028 INFO L131 PetriNetUnfolder]: For 2159/2159 co-relation queries the response was YES. [2023-08-31 23:25:39,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5419 conditions, 1879 events. 1159/1879 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10102 event pairs, 145 based on Foata normal form. 0/1873 useless extension candidates. Maximal degree in co-relation 5408. Up to 773 conditions per place. [2023-08-31 23:25:39,038 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 101 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2023-08-31 23:25:39,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 812 flow [2023-08-31 23:25:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:25:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:25:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2023-08-31 23:25:39,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737662337662338 [2023-08-31 23:25:39,042 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2023-08-31 23:25:39,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2023-08-31 23:25:39,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:39,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2023-08-31 23:25:39,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states 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:25:39,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:25:39,048 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states 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:25:39,048 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 7 states and 912 transitions. [2023-08-31 23:25:39,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 812 flow [2023-08-31 23:25:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 656 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:25:39,060 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 180 flow [2023-08-31 23:25:39,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-31 23:25:39,061 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-31 23:25:39,061 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 180 flow [2023-08-31 23:25:39,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:25:39,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:39,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:39,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:25:39,275 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:25:39,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:39,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1848342838, now seen corresponding path program 2 times [2023-08-31 23:25:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656520521] [2023-08-31 23:25:39,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:25:39,276 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:25:39,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:39,278 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:25:39,280 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:25:39,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:25:39,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:25:39,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:25:39,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:39,408 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:25:39,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:39,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656520521] [2023-08-31 23:25:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656520521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859505302] [2023-08-31 23:25:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:39,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-31 23:25:39,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 180 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:25:39,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:39,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-31 23:25:39,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:39,756 INFO L130 PetriNetUnfolder]: 2066/3171 cut-off events. [2023-08-31 23:25:39,756 INFO L131 PetriNetUnfolder]: For 2515/2515 co-relation queries the response was YES. [2023-08-31 23:25:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9132 conditions, 3171 events. 2066/3171 cut-off events. For 2515/2515 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17395 event pairs, 858 based on Foata normal form. 1/3151 useless extension candidates. Maximal degree in co-relation 9122. Up to 1777 conditions per place. [2023-08-31 23:25:39,770 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 75 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-31 23:25:39,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 490 flow [2023-08-31 23:25:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-31 23:25:39,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078787878787879 [2023-08-31 23:25:39,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-31 23:25:39,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-31 23:25:39,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:39,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-31 23:25:39,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:25:39,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:25:39,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:25:39,775 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 180 flow. Second operand 3 states and 419 transitions. [2023-08-31 23:25:39,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 490 flow [2023-08-31 23:25:39,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:25:39,803 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 186 flow [2023-08-31 23:25:39,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-31 23:25:39,803 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-31 23:25:39,804 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 186 flow [2023-08-31 23:25:39,804 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:25:39,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:39,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:39,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-31 23:25:40,014 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:25:40,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:40,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -98062826, now seen corresponding path program 3 times [2023-08-31 23:25:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:40,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198718472] [2023-08-31 23:25:40,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:25:40,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:25:40,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:40,017 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:25:40,019 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:25:40,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:25:40,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:25:40,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:25:40,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:40,169 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:25:40,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:40,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198718472] [2023-08-31 23:25:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198718472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:25:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775751590] [2023-08-31 23:25:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:25:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:25:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:25:40,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-31 23:25:40,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:25:40,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:40,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-31 23:25:40,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:40,643 INFO L130 PetriNetUnfolder]: 3389/5437 cut-off events. [2023-08-31 23:25:40,643 INFO L131 PetriNetUnfolder]: For 4153/4154 co-relation queries the response was YES. [2023-08-31 23:25:40,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15581 conditions, 5437 events. 3389/5437 cut-off events. For 4153/4154 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 33621 event pairs, 418 based on Foata normal form. 1/5437 useless extension candidates. Maximal degree in co-relation 15570. Up to 2588 conditions per place. [2023-08-31 23:25:40,667 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 92 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-31 23:25:40,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 606 flow [2023-08-31 23:25:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:25:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:25:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-31 23:25:40,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49636363636363634 [2023-08-31 23:25:40,669 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-31 23:25:40,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-31 23:25:40,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:40,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-31 23:25:40,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:25:40,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states 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:25:40,673 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states 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:25:40,673 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 186 flow. Second operand 4 states and 546 transitions. [2023-08-31 23:25:40,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 606 flow [2023-08-31 23:25:40,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:25:40,726 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 197 flow [2023-08-31 23:25:40,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-31 23:25:40,727 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-31 23:25:40,727 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 197 flow [2023-08-31 23:25:40,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:25:40,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:40,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:40,735 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:25:40,928 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:25:40,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:40,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1140525922, now seen corresponding path program 4 times [2023-08-31 23:25:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628282405] [2023-08-31 23:25:40,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:25:40,929 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:25:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:40,930 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:25:40,932 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:25:41,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:25:41,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:25:41,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:25:41,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:25:41,058 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:25:41,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:25:41,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:25:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628282405] [2023-08-31 23:25:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628282405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:25:41,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:25:41,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:25:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909052214] [2023-08-31 23:25:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:25:41,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:25:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:25:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:25:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:25:41,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-31 23:25:41,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 197 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:25:41,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:25:41,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-31 23:25:41,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:25:41,773 INFO L130 PetriNetUnfolder]: 5141/7891 cut-off events. [2023-08-31 23:25:41,774 INFO L131 PetriNetUnfolder]: For 7509/7510 co-relation queries the response was YES. [2023-08-31 23:25:41,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23780 conditions, 7891 events. 5141/7891 cut-off events. For 7509/7510 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 48665 event pairs, 1700 based on Foata normal form. 1/7821 useless extension candidates. Maximal degree in co-relation 23767. Up to 4126 conditions per place. [2023-08-31 23:25:41,816 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 73 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-31 23:25:41,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 495 flow [2023-08-31 23:25:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:25:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:25:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:25:41,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2023-08-31 23:25:41,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:25:41,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:25:41,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:25:41,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:25:41,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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:25:41,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:25:41,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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:25:41,822 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 197 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:25:41,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 495 flow [2023-08-31 23:25:41,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:25:41,950 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 208 flow [2023-08-31 23:25:41,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-08-31 23:25:41,951 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-31 23:25:41,951 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 208 flow [2023-08-31 23:25:41,952 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:25:41,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:25:41,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:41,961 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 (11)] Ended with exit code 0 [2023-08-31 23:25:42,156 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:25:42,156 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:25:42,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:25:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1902682054, now seen corresponding path program 5 times [2023-08-31 23:25:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:25:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729871857] [2023-08-31 23:25:42,158 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:25:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:25:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:25:42,159 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:25:42,162 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:25:42,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:25:42,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:25:42,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:25:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:25:42,472 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:25:42,472 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:25:42,473 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:25:42,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:25:42,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:25:42,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:25:42,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:25:42,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:25:42,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:25:42,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:25:42,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:25:42,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:25:42,490 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:25:42,688 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:25:42,689 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-31 23:25:42,693 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:25:42,693 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:25:42,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:25:42 BasicIcfg [2023-08-31 23:25:42,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:25:42,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:25:42,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:25:42,777 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:25:42,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:25:23" (3/4) ... [2023-08-31 23:25:42,780 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:25:42,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:25:42,780 INFO L158 Benchmark]: Toolchain (without parser) took 20770.87ms. Allocated memory was 60.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 36.7MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 647.7MB. Max. memory is 16.1GB. [2023-08-31 23:25:42,781 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:42,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.80ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 27.4MB in the end (delta: 9.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-31 23:25:42,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.00ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 51.0MB in the end (delta: -23.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2023-08-31 23:25:42,782 INFO L158 Benchmark]: Boogie Preprocessor took 61.58ms. Allocated memory is still 73.4MB. Free memory was 51.0MB in the beginning and 48.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:25:42,782 INFO L158 Benchmark]: RCFGBuilder took 791.10ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 40.9MB in the end (delta: 7.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-31 23:25:42,782 INFO L158 Benchmark]: TraceAbstraction took 19304.26ms. Allocated memory was 73.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 40.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. [2023-08-31 23:25:42,783 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 2.2GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:25:42,784 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.80ms. Allocated memory is still 60.8MB. Free memory was 36.5MB in the beginning and 27.4MB in the end (delta: 9.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.00ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 51.0MB in the end (delta: -23.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.58ms. Allocated memory is still 73.4MB. Free memory was 51.0MB in the beginning and 48.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 791.10ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 40.9MB in the end (delta: 7.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19304.26ms. Allocated memory was 73.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 40.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 2.2GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 148 PlacesBefore, 52 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 134 TotalNumberOfCompositions, 9228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4199, independent: 3995, independent conditional: 0, independent unconditional: 3995, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1813, independent: 1765, independent conditional: 0, independent unconditional: 1765, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4199, independent: 2230, independent conditional: 0, independent unconditional: 2230, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1813, unknown conditional: 0, unknown unconditional: 1813] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-1, t1457={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=0, t1457={11:0}, t1458={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=1, t1457={11:0}, t1458={15:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1460; [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=2, t1457={11:0}, t1458={15:0}, t1459={7:0}, t1460={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={11:0}, t1458={15:0}, t1459={7:0}, t1460={-2147483637:0}, weak$$choice2=0, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1872 IncrementalHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 36 mSDtfsCounter, 1872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 48, 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.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1488 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:25:42,817 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