./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.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/safe000_rmo.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 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --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:27:43,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:27:43,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:27:43,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:27:43,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:27:43,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:27:43,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:27:43,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:27:43,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:27:43,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:27:43,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:27:43,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:27:43,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:27:43,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:27:43,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:27:43,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:27:43,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:27:43,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:27:43,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:27:43,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:27:43,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:27:43,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:27:43,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:27:43,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:27:43,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:27:43,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:27:43,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:27:43,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:27:43,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:27:43,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:27:43,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:27:43,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:27:43,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:27:43,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:27:43,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:27:43,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:27:43,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:27:43,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:27:43,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:27:43,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:27:43,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:27:43,413 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:27:43,441 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:27:43,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:27:43,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:27:43,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:27:43,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:27:43,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:27:43,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:27:43,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:27:43,445 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:27:43,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:27:43,446 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:27:43,446 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:27:43,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:27:43,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:27:43,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:27:43,447 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:27:43,447 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:27:43,447 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:27:43,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:27:43,448 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:27:43,448 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:27:43,448 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:27:43,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:27:43,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:27:43,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:27:43,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:27:43,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:27:43,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:27:43,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:27:43,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:27:43,450 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:27:43,450 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:27:43,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:27:43,450 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:27:43,450 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 -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 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:27:43,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:27:43,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:27:43,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:27:43,784 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:27:43,784 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:27:43,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-08-31 23:27:45,055 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:27:45,311 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:27:45,312 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-08-31 23:27:45,325 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/648f26291/cb259d54e8ba4425a54bf7a6c6ae8b70/FLAGd032cf345 [2023-08-31 23:27:45,341 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/648f26291/cb259d54e8ba4425a54bf7a6c6ae8b70 [2023-08-31 23:27:45,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:27:45,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:27:45,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:27:45,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:27:45,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:27:45,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:45,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10287518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45, skipping insertion in model container [2023-08-31 23:27:45,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:45,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:27:45,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:27:45,533 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/safe000_rmo.i[988,1001] [2023-08-31 23:27:45,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:27:45,821 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:27:45,831 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/safe000_rmo.i[988,1001] [2023-08-31 23:27:45,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:27:45,915 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:27:45,915 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:27:45,921 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:27:45,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45 WrapperNode [2023-08-31 23:27:45,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:27:45,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:27:45,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:27:45,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:27:45,930 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:27:45" (1/1) ... [2023-08-31 23:27:45,946 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:27:45" (1/1) ... [2023-08-31 23:27:45,972 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-31 23:27:45,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:27:45,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:27:45,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:27:45,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:27:45,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:45,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:45,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:45,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:45,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:46,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:46,006 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:46,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:46,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:27:46,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:27:46,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:27:46,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:27:46,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (1/1) ... [2023-08-31 23:27:46,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:27:46,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:27:46,070 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:27:46,098 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:27:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:27:46,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:27:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:27:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:27:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:27:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:27:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:27:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:27:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:27:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:27:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:27:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:27:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:27:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:27:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:27:46,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:27:46,119 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:27:46,299 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:27:46,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:27:46,841 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:27:47,442 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:27:47,442 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:27:47,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:47 BoogieIcfgContainer [2023-08-31 23:27:47,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:27:47,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:27:47,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:27:47,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:27:47,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:27:45" (1/3) ... [2023-08-31 23:27:47,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b866bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:27:47, skipping insertion in model container [2023-08-31 23:27:47,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:45" (2/3) ... [2023-08-31 23:27:47,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b866bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:27:47, skipping insertion in model container [2023-08-31 23:27:47,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:47" (3/3) ... [2023-08-31 23:27:47,453 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-08-31 23:27:47,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:27:47,471 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-08-31 23:27:47,471 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:27:47,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:27:47,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 189 transitions, 393 flow [2023-08-31 23:27:47,756 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2023-08-31 23:27:47,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:27:47,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 355 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-31 23:27:47,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 189 transitions, 393 flow [2023-08-31 23:27:47,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 186 transitions, 381 flow [2023-08-31 23:27:47,776 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:27:47,794 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 186 transitions, 381 flow [2023-08-31 23:27:47,797 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 186 transitions, 381 flow [2023-08-31 23:27:47,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 186 transitions, 381 flow [2023-08-31 23:27:47,842 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2023-08-31 23:27:47,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:27:47,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 361 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-31 23:27:47,847 INFO L119 LiptonReduction]: Number of co-enabled transitions 8500 [2023-08-31 23:28:07,802 INFO L134 LiptonReduction]: Checked pairs total: 43557 [2023-08-31 23:28:07,802 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-31 23:28:07,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:28:07,821 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;@75eafe14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:28:07,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-08-31 23:28:07,823 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:28:07,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:07,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:07,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:28:07,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:07,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1200, now seen corresponding path program 1 times [2023-08-31 23:28:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:07,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632621224] [2023-08-31 23:28:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:07,934 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:28:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632621224] [2023-08-31 23:28:07,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632621224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:07,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:07,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:28:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344147580] [2023-08-31 23:28:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:07,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:28:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:28:07,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:28:07,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 347 [2023-08-31 23:28:07,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:07,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:07,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 347 [2023-08-31 23:28:07,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:12,108 INFO L130 PetriNetUnfolder]: 18354/25862 cut-off events. [2023-08-31 23:28:12,108 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:28:12,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51649 conditions, 25862 events. 18354/25862 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 180991 event pairs, 18354 based on Foata normal form. 400/10667 useless extension candidates. Maximal degree in co-relation 51638. Up to 25691 conditions per place. [2023-08-31 23:28:12,274 INFO L137 encePairwiseOnDemand]: 309/347 looper letters, 45 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2023-08-31 23:28:12,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 201 flow [2023-08-31 23:28:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:28:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:28:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-31 23:28:12,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48559077809798273 [2023-08-31 23:28:12,293 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-31 23:28:12,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-31 23:28:12,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:12,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-31 23:28:12,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:12,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 347.0) internal successors, (1041), 3 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:12,306 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 347.0) internal successors, (1041), 3 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:12,308 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 337 transitions. [2023-08-31 23:28:12,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 201 flow [2023-08-31 23:28:12,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:12,316 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2023-08-31 23:28:12,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-31 23:28:12,321 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-31 23:28:12,321 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2023-08-31 23:28:12,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:12,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:12,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:28:12,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:28:12,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:12,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1184636, now seen corresponding path program 1 times [2023-08-31 23:28:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:12,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631109555] [2023-08-31 23:28:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:12,587 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:28:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631109555] [2023-08-31 23:28:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631109555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:12,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085973610] [2023-08-31 23:28:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:12,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:12,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:12,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:12,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 347 [2023-08-31 23:28:12,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 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:28:12,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:12,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 347 [2023-08-31 23:28:12,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:13,993 INFO L130 PetriNetUnfolder]: 6106/8809 cut-off events. [2023-08-31 23:28:13,994 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17581 conditions, 8809 events. 6106/8809 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 54662 event pairs, 6106 based on Foata normal form. 432/5181 useless extension candidates. Maximal degree in co-relation 17578. Up to 8711 conditions per place. [2023-08-31 23:28:14,029 INFO L137 encePairwiseOnDemand]: 336/347 looper letters, 35 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-31 23:28:14,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 160 flow [2023-08-31 23:28:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-31 23:28:14,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015369836695485 [2023-08-31 23:28:14,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-31 23:28:14,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-31 23:28:14,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:14,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-31 23:28:14,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:14,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:14,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:14,036 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 418 transitions. [2023-08-31 23:28:14,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 160 flow [2023-08-31 23:28:14,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:28:14,038 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 90 flow [2023-08-31 23:28:14,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-31 23:28:14,039 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-31 23:28:14,039 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 90 flow [2023-08-31 23:28:14,039 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:28:14,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:14,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:28:14,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:28:14,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:14,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1184635, now seen corresponding path program 1 times [2023-08-31 23:28:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335332511] [2023-08-31 23:28:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:14,135 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:28:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335332511] [2023-08-31 23:28:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335332511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22745162] [2023-08-31 23:28:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:14,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-31 23:28:14,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:14,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:14,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-31 23:28:14,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:15,171 INFO L130 PetriNetUnfolder]: 5247/8108 cut-off events. [2023-08-31 23:28:15,172 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:15,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16157 conditions, 8108 events. 5247/8108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 51190 event pairs, 3049 based on Foata normal form. 0/6049 useless extension candidates. Maximal degree in co-relation 16153. Up to 4417 conditions per place. [2023-08-31 23:28:15,211 INFO L137 encePairwiseOnDemand]: 325/347 looper letters, 38 selfloop transitions, 11 changer transitions 1/51 dead transitions. [2023-08-31 23:28:15,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 210 flow [2023-08-31 23:28:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-31 23:28:15,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015369836695485 [2023-08-31 23:28:15,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-31 23:28:15,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-31 23:28:15,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:15,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-31 23:28:15,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:15,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:15,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:15,218 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 90 flow. Second operand 3 states and 418 transitions. [2023-08-31 23:28:15,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 210 flow [2023-08-31 23:28:15,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:15,220 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 177 flow [2023-08-31 23:28:15,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-31 23:28:15,221 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-31 23:28:15,221 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 177 flow [2023-08-31 23:28:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:15,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:15,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:15,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:28:15,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:15,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2053717382, now seen corresponding path program 1 times [2023-08-31 23:28:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517822602] [2023-08-31 23:28:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:15,990 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:28:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517822602] [2023-08-31 23:28:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517822602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994632213] [2023-08-31 23:28:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:15,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:15,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:15,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 347 [2023-08-31 23:28:15,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:15,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:16,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 347 [2023-08-31 23:28:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:16,937 INFO L130 PetriNetUnfolder]: 4670/7473 cut-off events. [2023-08-31 23:28:16,937 INFO L131 PetriNetUnfolder]: For 2378/2452 co-relation queries the response was YES. [2023-08-31 23:28:16,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20955 conditions, 7473 events. 4670/7473 cut-off events. For 2378/2452 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 49465 event pairs, 1915 based on Foata normal form. 0/6467 useless extension candidates. Maximal degree in co-relation 20950. Up to 6032 conditions per place. [2023-08-31 23:28:16,975 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 62 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-31 23:28:16,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 419 flow [2023-08-31 23:28:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-31 23:28:16,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4207492795389049 [2023-08-31 23:28:16,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-31 23:28:16,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-31 23:28:16,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:16,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-31 23:28:16,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:16,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:16,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:16,982 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 177 flow. Second operand 3 states and 438 transitions. [2023-08-31 23:28:16,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 419 flow [2023-08-31 23:28:17,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:17,004 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 200 flow [2023-08-31 23:28:17,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-31 23:28:17,005 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-31 23:28:17,005 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 200 flow [2023-08-31 23:28:17,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:17,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:17,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:17,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:28:17,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:17,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash -759272171, now seen corresponding path program 1 times [2023-08-31 23:28:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:17,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459170626] [2023-08-31 23:28:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:17,386 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:28:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459170626] [2023-08-31 23:28:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459170626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:17,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:17,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:28:17,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816889606] [2023-08-31 23:28:17,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:17,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:17,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:17,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:17,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 347 [2023-08-31 23:28:17,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:17,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:17,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 347 [2023-08-31 23:28:17,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:18,243 INFO L130 PetriNetUnfolder]: 4640/7429 cut-off events. [2023-08-31 23:28:18,244 INFO L131 PetriNetUnfolder]: For 2088/2149 co-relation queries the response was YES. [2023-08-31 23:28:18,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20424 conditions, 7429 events. 4640/7429 cut-off events. For 2088/2149 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 49233 event pairs, 1416 based on Foata normal form. 0/5945 useless extension candidates. Maximal degree in co-relation 20418. Up to 5160 conditions per place. [2023-08-31 23:28:18,288 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 79 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2023-08-31 23:28:18,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 93 transitions, 514 flow [2023-08-31 23:28:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-08-31 23:28:18,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106628242074928 [2023-08-31 23:28:18,291 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-08-31 23:28:18,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-08-31 23:28:18,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:18,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-08-31 23:28:18,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:18,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:18,297 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:18,297 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 200 flow. Second operand 4 states and 570 transitions. [2023-08-31 23:28:18,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 93 transitions, 514 flow [2023-08-31 23:28:18,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 93 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:18,303 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 215 flow [2023-08-31 23:28:18,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-31 23:28:18,307 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -44 predicate places. [2023-08-31 23:28:18,307 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 215 flow [2023-08-31 23:28:18,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:18,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:18,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:18,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:28:18,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:18,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash -759272528, now seen corresponding path program 1 times [2023-08-31 23:28:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:18,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190260964] [2023-08-31 23:28:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:18,427 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:28:18,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:18,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190260964] [2023-08-31 23:28:18,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190260964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:18,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68311212] [2023-08-31 23:28:18,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:18,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:18,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:18,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:18,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:18,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 347 [2023-08-31 23:28:18,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:18,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:18,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 347 [2023-08-31 23:28:18,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:19,410 INFO L130 PetriNetUnfolder]: 5467/8790 cut-off events. [2023-08-31 23:28:19,410 INFO L131 PetriNetUnfolder]: For 3442/3442 co-relation queries the response was YES. [2023-08-31 23:28:19,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24978 conditions, 8790 events. 5467/8790 cut-off events. For 3442/3442 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 60347 event pairs, 1759 based on Foata normal form. 0/7334 useless extension candidates. Maximal degree in co-relation 24971. Up to 3872 conditions per place. [2023-08-31 23:28:19,444 INFO L137 encePairwiseOnDemand]: 335/347 looper letters, 58 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2023-08-31 23:28:19,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 78 transitions, 458 flow [2023-08-31 23:28:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-31 23:28:19,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39337175792507206 [2023-08-31 23:28:19,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-31 23:28:19,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-31 23:28:19,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:19,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-31 23:28:19,449 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:28:19,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:19,452 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:19,452 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 215 flow. Second operand 4 states and 546 transitions. [2023-08-31 23:28:19,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 78 transitions, 458 flow [2023-08-31 23:28:19,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:19,456 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 269 flow [2023-08-31 23:28:19,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-08-31 23:28:19,457 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -42 predicate places. [2023-08-31 23:28:19,457 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 269 flow [2023-08-31 23:28:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:19,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:19,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:19,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:28:19,458 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:19,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -759272527, now seen corresponding path program 1 times [2023-08-31 23:28:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171980245] [2023-08-31 23:28:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:19,669 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:28:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171980245] [2023-08-31 23:28:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171980245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:19,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595392431] [2023-08-31 23:28:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:19,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:19,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:19,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 347 [2023-08-31 23:28:19,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:19,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:19,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 347 [2023-08-31 23:28:19,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:21,149 INFO L130 PetriNetUnfolder]: 7646/12253 cut-off events. [2023-08-31 23:28:21,149 INFO L131 PetriNetUnfolder]: For 9277/9277 co-relation queries the response was YES. [2023-08-31 23:28:21,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37256 conditions, 12253 events. 7646/12253 cut-off events. For 9277/9277 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 88959 event pairs, 3414 based on Foata normal form. 50/11035 useless extension candidates. Maximal degree in co-relation 37248. Up to 6181 conditions per place. [2023-08-31 23:28:21,190 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 80 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2023-08-31 23:28:21,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 594 flow [2023-08-31 23:28:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-31 23:28:21,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854466858789625 [2023-08-31 23:28:21,194 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-31 23:28:21,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-31 23:28:21,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:21,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-31 23:28:21,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:21,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:21,198 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:21,198 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 269 flow. Second operand 4 states and 535 transitions. [2023-08-31 23:28:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 594 flow [2023-08-31 23:28:21,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:21,264 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 282 flow [2023-08-31 23:28:21,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-08-31 23:28:21,265 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-31 23:28:21,265 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 282 flow [2023-08-31 23:28:21,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:21,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:21,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:21,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:28:21,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:21,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -454086675, now seen corresponding path program 2 times [2023-08-31 23:28:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220286794] [2023-08-31 23:28:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:21,518 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:28:21,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220286794] [2023-08-31 23:28:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220286794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:28:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596151098] [2023-08-31 23:28:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:21,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:28:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:28:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:28:21,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 347 [2023-08-31 23:28:21,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:21,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:21,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 347 [2023-08-31 23:28:21,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:22,781 INFO L130 PetriNetUnfolder]: 7541/12096 cut-off events. [2023-08-31 23:28:22,781 INFO L131 PetriNetUnfolder]: For 12656/12656 co-relation queries the response was YES. [2023-08-31 23:28:22,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36135 conditions, 12096 events. 7541/12096 cut-off events. For 12656/12656 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 87954 event pairs, 3451 based on Foata normal form. 50/10467 useless extension candidates. Maximal degree in co-relation 36126. Up to 8635 conditions per place. [2023-08-31 23:28:22,831 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 79 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-08-31 23:28:22,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 567 flow [2023-08-31 23:28:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-31 23:28:22,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38472622478386165 [2023-08-31 23:28:22,833 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-31 23:28:22,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-31 23:28:22,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:22,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-31 23:28:22,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:22,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:22,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:22,837 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 282 flow. Second operand 4 states and 534 transitions. [2023-08-31 23:28:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 567 flow [2023-08-31 23:28:22,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 555 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:22,922 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 286 flow [2023-08-31 23:28:22,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-31 23:28:22,923 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -37 predicate places. [2023-08-31 23:28:22,923 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 286 flow [2023-08-31 23:28:22,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:22,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:22,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:22,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:28:22,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:22,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -760895610, now seen corresponding path program 1 times [2023-08-31 23:28:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70372245] [2023-08-31 23:28:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:23,756 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:28:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70372245] [2023-08-31 23:28:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70372245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811456339] [2023-08-31 23:28:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:23,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:23,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 347 [2023-08-31 23:28:23,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:23,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:23,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 347 [2023-08-31 23:28:23,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:24,796 INFO L130 PetriNetUnfolder]: 6872/11134 cut-off events. [2023-08-31 23:28:24,796 INFO L131 PetriNetUnfolder]: For 17422/17491 co-relation queries the response was YES. [2023-08-31 23:28:24,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33408 conditions, 11134 events. 6872/11134 cut-off events. For 17422/17491 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 83652 event pairs, 2001 based on Foata normal form. 17/9018 useless extension candidates. Maximal degree in co-relation 33398. Up to 8728 conditions per place. [2023-08-31 23:28:24,859 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 82 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-31 23:28:24,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 653 flow [2023-08-31 23:28:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-31 23:28:24,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.414985590778098 [2023-08-31 23:28:24,863 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-31 23:28:24,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-31 23:28:24,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:24,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-31 23:28:24,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:24,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:24,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:24,866 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 286 flow. Second operand 3 states and 432 transitions. [2023-08-31 23:28:24,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 653 flow [2023-08-31 23:28:24,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 643 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:24,938 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 290 flow [2023-08-31 23:28:24,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-08-31 23:28:24,938 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -36 predicate places. [2023-08-31 23:28:24,938 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 290 flow [2023-08-31 23:28:24,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:24,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:24,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:24,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:28:24,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:24,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -760895966, now seen corresponding path program 1 times [2023-08-31 23:28:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:24,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572300822] [2023-08-31 23:28:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:28:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572300822] [2023-08-31 23:28:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572300822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596432859] [2023-08-31 23:28:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:25,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:25,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:25,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:25,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 347 [2023-08-31 23:28:25,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:25,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:25,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 347 [2023-08-31 23:28:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:26,107 INFO L130 PetriNetUnfolder]: 6779/11049 cut-off events. [2023-08-31 23:28:26,107 INFO L131 PetriNetUnfolder]: For 12550/12699 co-relation queries the response was YES. [2023-08-31 23:28:26,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33974 conditions, 11049 events. 6779/11049 cut-off events. For 12550/12699 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 81728 event pairs, 3222 based on Foata normal form. 34/9073 useless extension candidates. Maximal degree in co-relation 33963. Up to 7240 conditions per place. [2023-08-31 23:28:26,155 INFO L137 encePairwiseOnDemand]: 343/347 looper letters, 69 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-08-31 23:28:26,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 530 flow [2023-08-31 23:28:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-31 23:28:26,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41786743515850144 [2023-08-31 23:28:26,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-31 23:28:26,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-31 23:28:26,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:26,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-31 23:28:26,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,159 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 290 flow. Second operand 3 states and 435 transitions. [2023-08-31 23:28:26,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 530 flow [2023-08-31 23:28:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 512 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:28:26,221 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 270 flow [2023-08-31 23:28:26,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-08-31 23:28:26,222 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -40 predicate places. [2023-08-31 23:28:26,222 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 270 flow [2023-08-31 23:28:26,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:26,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:26,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:28:26,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:26,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 241704201, now seen corresponding path program 1 times [2023-08-31 23:28:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:26,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278074694] [2023-08-31 23:28:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:27,006 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:28:27,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278074694] [2023-08-31 23:28:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278074694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:27,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:27,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:28:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868192255] [2023-08-31 23:28:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:27,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:28:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:27,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:28:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:28:27,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 347 [2023-08-31 23:28:27,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:27,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:27,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 347 [2023-08-31 23:28:27,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:28,712 INFO L130 PetriNetUnfolder]: 9610/15061 cut-off events. [2023-08-31 23:28:28,713 INFO L131 PetriNetUnfolder]: For 10395/10582 co-relation queries the response was YES. [2023-08-31 23:28:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44495 conditions, 15061 events. 9610/15061 cut-off events. For 10395/10582 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 104529 event pairs, 4746 based on Foata normal form. 14/12376 useless extension candidates. Maximal degree in co-relation 44486. Up to 11143 conditions per place. [2023-08-31 23:28:28,793 INFO L137 encePairwiseOnDemand]: 344/347 looper letters, 69 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-08-31 23:28:28,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 514 flow [2023-08-31 23:28:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-31 23:28:28,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053794428434198 [2023-08-31 23:28:28,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-31 23:28:28,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-31 23:28:28,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:28,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-31 23:28:28,796 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:28:28,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:28,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:28,797 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 270 flow. Second operand 3 states and 422 transitions. [2023-08-31 23:28:28,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 514 flow [2023-08-31 23:28:28,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:28,805 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 277 flow [2023-08-31 23:28:28,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-08-31 23:28:28,806 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-31 23:28:28,806 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 277 flow [2023-08-31 23:28:28,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:28,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:28,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:28,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:28:28,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:28,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2062544097, now seen corresponding path program 1 times [2023-08-31 23:28:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703823439] [2023-08-31 23:28:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:28,987 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:28:28,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:28,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703823439] [2023-08-31 23:28:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703823439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:28,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543322797] [2023-08-31 23:28:28,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:28,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:29,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 347 [2023-08-31 23:28:29,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:29,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:29,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 347 [2023-08-31 23:28:29,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:30,476 INFO L130 PetriNetUnfolder]: 6215/9935 cut-off events. [2023-08-31 23:28:30,476 INFO L131 PetriNetUnfolder]: For 7399/7399 co-relation queries the response was YES. [2023-08-31 23:28:30,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31428 conditions, 9935 events. 6215/9935 cut-off events. For 7399/7399 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 68905 event pairs, 2373 based on Foata normal form. 70/8379 useless extension candidates. Maximal degree in co-relation 31418. Up to 4124 conditions per place. [2023-08-31 23:28:30,528 INFO L137 encePairwiseOnDemand]: 329/347 looper letters, 61 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2023-08-31 23:28:30,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 569 flow [2023-08-31 23:28:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-31 23:28:30,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37752161383285304 [2023-08-31 23:28:30,531 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-31 23:28:30,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-31 23:28:30,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:30,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-31 23:28:30,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:30,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:30,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:30,535 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 277 flow. Second operand 4 states and 524 transitions. [2023-08-31 23:28:30,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 569 flow [2023-08-31 23:28:30,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 549 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:30,545 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 407 flow [2023-08-31 23:28:30,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=407, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-08-31 23:28:30,546 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -36 predicate places. [2023-08-31 23:28:30,546 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 407 flow [2023-08-31 23:28:30,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:30,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:30,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:30,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:28:30,547 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:30,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2015670614, now seen corresponding path program 1 times [2023-08-31 23:28:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546421522] [2023-08-31 23:28:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:30,953 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:28:30,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546421522] [2023-08-31 23:28:30,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546421522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:30,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:30,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902343318] [2023-08-31 23:28:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:30,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:30,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:30,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 347 [2023-08-31 23:28:30,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 407 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:30,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:30,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 347 [2023-08-31 23:28:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:32,839 INFO L130 PetriNetUnfolder]: 10975/17424 cut-off events. [2023-08-31 23:28:32,839 INFO L131 PetriNetUnfolder]: For 22751/23659 co-relation queries the response was YES. [2023-08-31 23:28:32,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58962 conditions, 17424 events. 10975/17424 cut-off events. For 22751/23659 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 133452 event pairs, 1913 based on Foata normal form. 388/15516 useless extension candidates. Maximal degree in co-relation 58951. Up to 6689 conditions per place. [2023-08-31 23:28:32,943 INFO L137 encePairwiseOnDemand]: 342/347 looper letters, 144 selfloop transitions, 9 changer transitions 0/161 dead transitions. [2023-08-31 23:28:32,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 161 transitions, 1248 flow [2023-08-31 23:28:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-08-31 23:28:32,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41037463976945243 [2023-08-31 23:28:32,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-08-31 23:28:32,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-08-31 23:28:32,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:32,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-08-31 23:28:32,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:32,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:32,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:32,951 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 407 flow. Second operand 5 states and 712 transitions. [2023-08-31 23:28:32,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 161 transitions, 1248 flow [2023-08-31 23:28:33,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 161 transitions, 1236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:33,022 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 439 flow [2023-08-31 23:28:33,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=439, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-08-31 23:28:33,022 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -31 predicate places. [2023-08-31 23:28:33,022 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 439 flow [2023-08-31 23:28:33,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:33,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:33,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:33,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:28:33,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:33,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2124972398, now seen corresponding path program 1 times [2023-08-31 23:28:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536263415] [2023-08-31 23:28:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:33,647 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:28:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:33,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536263415] [2023-08-31 23:28:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536263415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:33,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:33,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:28:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939350312] [2023-08-31 23:28:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:33,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:28:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:28:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:28:34,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 347 [2023-08-31 23:28:34,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:34,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:34,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 347 [2023-08-31 23:28:34,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:35,475 INFO L130 PetriNetUnfolder]: 7234/11901 cut-off events. [2023-08-31 23:28:35,475 INFO L131 PetriNetUnfolder]: For 16496/16885 co-relation queries the response was YES. [2023-08-31 23:28:35,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41958 conditions, 11901 events. 7234/11901 cut-off events. For 16496/16885 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 89099 event pairs, 2821 based on Foata normal form. 77/11063 useless extension candidates. Maximal degree in co-relation 41944. Up to 6777 conditions per place. [2023-08-31 23:28:35,552 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 118 selfloop transitions, 21 changer transitions 0/148 dead transitions. [2023-08-31 23:28:35,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 148 transitions, 1235 flow [2023-08-31 23:28:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:28:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:28:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1088 transitions. [2023-08-31 23:28:35,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3483829650976625 [2023-08-31 23:28:35,556 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1088 transitions. [2023-08-31 23:28:35,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1088 transitions. [2023-08-31 23:28:35,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:35,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1088 transitions. [2023-08-31 23:28:35,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:35,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:35,563 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:35,563 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 439 flow. Second operand 9 states and 1088 transitions. [2023-08-31 23:28:35,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 148 transitions, 1235 flow [2023-08-31 23:28:35,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 148 transitions, 1196 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:35,604 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 658 flow [2023-08-31 23:28:35,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=658, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2023-08-31 23:28:35,605 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2023-08-31 23:28:35,605 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 658 flow [2023-08-31 23:28:35,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:35,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:35,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:35,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:28:35,606 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:35,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash 485641807, now seen corresponding path program 1 times [2023-08-31 23:28:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:35,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568808017] [2023-08-31 23:28:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:35,832 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:28:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568808017] [2023-08-31 23:28:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568808017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:35,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:28:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123173856] [2023-08-31 23:28:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:35,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:28:35,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:28:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:28:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 347 [2023-08-31 23:28:35,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 658 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:35,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:35,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 347 [2023-08-31 23:28:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:37,146 INFO L130 PetriNetUnfolder]: 6178/10085 cut-off events. [2023-08-31 23:28:37,146 INFO L131 PetriNetUnfolder]: For 15074/15106 co-relation queries the response was YES. [2023-08-31 23:28:37,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37238 conditions, 10085 events. 6178/10085 cut-off events. For 15074/15106 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 70544 event pairs, 2606 based on Foata normal form. 306/10090 useless extension candidates. Maximal degree in co-relation 37219. Up to 4173 conditions per place. [2023-08-31 23:28:37,196 INFO L137 encePairwiseOnDemand]: 328/347 looper letters, 88 selfloop transitions, 25 changer transitions 0/114 dead transitions. [2023-08-31 23:28:37,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 114 transitions, 1091 flow [2023-08-31 23:28:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:28:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:28:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-31 23:28:37,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611911623439001 [2023-08-31 23:28:37,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-31 23:28:37,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-31 23:28:37,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:37,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-31 23:28:37,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:37,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:37,204 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 347.0) internal successors, (2429), 7 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:37,204 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 658 flow. Second operand 6 states and 752 transitions. [2023-08-31 23:28:37,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 114 transitions, 1091 flow [2023-08-31 23:28:37,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 114 transitions, 1085 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-31 23:28:37,316 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 848 flow [2023-08-31 23:28:37,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=848, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2023-08-31 23:28:37,317 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -14 predicate places. [2023-08-31 23:28:37,317 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 848 flow [2023-08-31 23:28:37,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:37,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:37,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:37,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:28:37,318 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:37,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1007969048, now seen corresponding path program 1 times [2023-08-31 23:28:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357178740] [2023-08-31 23:28:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:38,809 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:28:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357178740] [2023-08-31 23:28:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357178740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:38,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:28:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330296199] [2023-08-31 23:28:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:38,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:28:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:38,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:28:38,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:28:39,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 347 [2023-08-31 23:28:39,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 848 flow. Second operand has 10 states, 10 states have (on average 106.4) internal successors, (1064), 10 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:39,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:39,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 347 [2023-08-31 23:28:39,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:41,092 INFO L130 PetriNetUnfolder]: 8048/13166 cut-off events. [2023-08-31 23:28:41,092 INFO L131 PetriNetUnfolder]: For 25358/25406 co-relation queries the response was YES. [2023-08-31 23:28:41,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53424 conditions, 13166 events. 8048/13166 cut-off events. For 25358/25406 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 98122 event pairs, 2340 based on Foata normal form. 80/12752 useless extension candidates. Maximal degree in co-relation 53403. Up to 9679 conditions per place. [2023-08-31 23:28:41,157 INFO L137 encePairwiseOnDemand]: 337/347 looper letters, 141 selfloop transitions, 20 changer transitions 0/162 dead transitions. [2023-08-31 23:28:41,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 162 transitions, 1622 flow [2023-08-31 23:28:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:28:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:28:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1142 transitions. [2023-08-31 23:28:41,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32910662824207493 [2023-08-31 23:28:41,162 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1142 transitions. [2023-08-31 23:28:41,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1142 transitions. [2023-08-31 23:28:41,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:41,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1142 transitions. [2023-08-31 23:28:41,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.2) internal successors, (1142), 10 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:41,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 347.0) internal successors, (3817), 11 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:41,169 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 347.0) internal successors, (3817), 11 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:41,169 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 848 flow. Second operand 10 states and 1142 transitions. [2023-08-31 23:28:41,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 162 transitions, 1622 flow [2023-08-31 23:28:41,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 162 transitions, 1588 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:41,340 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 1006 flow [2023-08-31 23:28:41,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1006, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2023-08-31 23:28:41,341 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -3 predicate places. [2023-08-31 23:28:41,341 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 1006 flow [2023-08-31 23:28:41,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.4) internal successors, (1064), 10 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:41,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:41,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:41,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:28:41,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:41,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2099375532, now seen corresponding path program 2 times [2023-08-31 23:28:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:41,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890403990] [2023-08-31 23:28:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:42,771 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:28:42,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890403990] [2023-08-31 23:28:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890403990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:42,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:42,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:28:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580868454] [2023-08-31 23:28:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:28:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:28:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:28:42,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-31 23:28:42,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 1006 flow. Second operand has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:42,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:42,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-31 23:28:42,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:45,703 INFO L130 PetriNetUnfolder]: 12146/19846 cut-off events. [2023-08-31 23:28:45,703 INFO L131 PetriNetUnfolder]: For 32406/32454 co-relation queries the response was YES. [2023-08-31 23:28:45,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81776 conditions, 19846 events. 12146/19846 cut-off events. For 32406/32454 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 158824 event pairs, 5158 based on Foata normal form. 100/19046 useless extension candidates. Maximal degree in co-relation 81749. Up to 13057 conditions per place. [2023-08-31 23:28:45,854 INFO L137 encePairwiseOnDemand]: 330/347 looper letters, 196 selfloop transitions, 54 changer transitions 1/252 dead transitions. [2023-08-31 23:28:45,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 252 transitions, 2545 flow [2023-08-31 23:28:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-31 23:28:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-31 23:28:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1729 transitions. [2023-08-31 23:28:45,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33218059558117197 [2023-08-31 23:28:45,859 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1729 transitions. [2023-08-31 23:28:45,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1729 transitions. [2023-08-31 23:28:45,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:45,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1729 transitions. [2023-08-31 23:28:45,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.26666666666667) internal successors, (1729), 15 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:45,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 347.0) internal successors, (5552), 16 states have internal predecessors, (5552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:45,870 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 347.0) internal successors, (5552), 16 states have internal predecessors, (5552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:45,870 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 1006 flow. Second operand 15 states and 1729 transitions. [2023-08-31 23:28:45,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 252 transitions, 2545 flow [2023-08-31 23:28:46,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 252 transitions, 2512 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:46,295 INFO L231 Difference]: Finished difference. Result has 120 places, 158 transitions, 1729 flow [2023-08-31 23:28:46,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1729, PETRI_PLACES=120, PETRI_TRANSITIONS=158} [2023-08-31 23:28:46,295 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 22 predicate places. [2023-08-31 23:28:46,295 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 158 transitions, 1729 flow [2023-08-31 23:28:46,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:46,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:46,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:46,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:28:46,297 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:46,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1164071024, now seen corresponding path program 2 times [2023-08-31 23:28:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286535925] [2023-08-31 23:28:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:46,678 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:28:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286535925] [2023-08-31 23:28:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286535925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:46,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:46,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:28:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191744737] [2023-08-31 23:28:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:46,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:28:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:28:46,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:28:46,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-31 23:28:46,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 158 transitions, 1729 flow. Second operand has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:46,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:46,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-31 23:28:46,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:49,325 INFO L130 PetriNetUnfolder]: 9950/16099 cut-off events. [2023-08-31 23:28:49,325 INFO L131 PetriNetUnfolder]: For 44330/44362 co-relation queries the response was YES. [2023-08-31 23:28:49,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71616 conditions, 16099 events. 9950/16099 cut-off events. For 44330/44362 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 120672 event pairs, 2049 based on Foata normal form. 38/15963 useless extension candidates. Maximal degree in co-relation 71576. Up to 5795 conditions per place. [2023-08-31 23:28:49,424 INFO L137 encePairwiseOnDemand]: 340/347 looper letters, 178 selfloop transitions, 28 changer transitions 6/213 dead transitions. [2023-08-31 23:28:49,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 213 transitions, 2457 flow [2023-08-31 23:28:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:28:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:28:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2023-08-31 23:28:49,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33511733223548784 [2023-08-31 23:28:49,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2023-08-31 23:28:49,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2023-08-31 23:28:49,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:49,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2023-08-31 23:28:49,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:49,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:49,432 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:49,432 INFO L175 Difference]: Start difference. First operand has 120 places, 158 transitions, 1729 flow. Second operand 7 states and 814 transitions. [2023-08-31 23:28:49,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 213 transitions, 2457 flow [2023-08-31 23:28:50,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 213 transitions, 2386 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:50,101 INFO L231 Difference]: Finished difference. Result has 124 places, 150 transitions, 1622 flow [2023-08-31 23:28:50,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1622, PETRI_PLACES=124, PETRI_TRANSITIONS=150} [2023-08-31 23:28:50,102 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2023-08-31 23:28:50,102 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 150 transitions, 1622 flow [2023-08-31 23:28:50,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:50,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:50,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:50,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:28:50,103 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:50,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2114069530, now seen corresponding path program 3 times [2023-08-31 23:28:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814677302] [2023-08-31 23:28:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:51,322 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:28:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814677302] [2023-08-31 23:28:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814677302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970904716] [2023-08-31 23:28:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:51,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-31 23:28:51,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 150 transitions, 1622 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:51,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:51,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-31 23:28:51,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:53,692 INFO L130 PetriNetUnfolder]: 9983/16029 cut-off events. [2023-08-31 23:28:53,693 INFO L131 PetriNetUnfolder]: For 55636/55671 co-relation queries the response was YES. [2023-08-31 23:28:53,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72862 conditions, 16029 events. 9983/16029 cut-off events. For 55636/55671 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 119638 event pairs, 5053 based on Foata normal form. 191/16220 useless extension candidates. Maximal degree in co-relation 72822. Up to 13182 conditions per place. [2023-08-31 23:28:53,806 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 154 selfloop transitions, 54 changer transitions 0/211 dead transitions. [2023-08-31 23:28:53,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 211 transitions, 2582 flow [2023-08-31 23:28:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-31 23:28:53,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38386167146974065 [2023-08-31 23:28:53,808 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-31 23:28:53,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-31 23:28:53,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:53,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-31 23:28:53,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:53,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:53,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:53,812 INFO L175 Difference]: Start difference. First operand has 124 places, 150 transitions, 1622 flow. Second operand 5 states and 666 transitions. [2023-08-31 23:28:53,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 211 transitions, 2582 flow [2023-08-31 23:28:54,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 211 transitions, 2498 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 23:28:54,330 INFO L231 Difference]: Finished difference. Result has 121 places, 157 transitions, 1805 flow [2023-08-31 23:28:54,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1805, PETRI_PLACES=121, PETRI_TRANSITIONS=157} [2023-08-31 23:28:54,331 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 23 predicate places. [2023-08-31 23:28:54,331 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 157 transitions, 1805 flow [2023-08-31 23:28:54,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:54,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:54,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:54,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:28:54,332 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:54,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 994608380, now seen corresponding path program 4 times [2023-08-31 23:28:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327919803] [2023-08-31 23:28:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:56,184 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:28:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327919803] [2023-08-31 23:28:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327919803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:28:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908410721] [2023-08-31 23:28:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:56,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:28:56,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:56,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:28:56,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:28:56,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 347 [2023-08-31 23:28:56,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 157 transitions, 1805 flow. Second operand has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:56,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:56,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 347 [2023-08-31 23:28:56,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:58,546 INFO L130 PetriNetUnfolder]: 10530/16916 cut-off events. [2023-08-31 23:28:58,547 INFO L131 PetriNetUnfolder]: For 62606/62636 co-relation queries the response was YES. [2023-08-31 23:28:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78513 conditions, 16916 events. 10530/16916 cut-off events. For 62606/62636 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 127725 event pairs, 4655 based on Foata normal form. 32/16948 useless extension candidates. Maximal degree in co-relation 78472. Up to 14551 conditions per place. [2023-08-31 23:28:58,719 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 149 selfloop transitions, 75 changer transitions 1/228 dead transitions. [2023-08-31 23:28:58,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 228 transitions, 2987 flow [2023-08-31 23:28:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-31 23:28:58,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37175792507204614 [2023-08-31 23:28:58,724 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-31 23:28:58,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-31 23:28:58,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:58,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-31 23:28:58,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:58,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:58,727 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:58,727 INFO L175 Difference]: Start difference. First operand has 121 places, 157 transitions, 1805 flow. Second operand 5 states and 645 transitions. [2023-08-31 23:28:58,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 228 transitions, 2987 flow [2023-08-31 23:28:59,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 228 transitions, 2884 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:59,629 INFO L231 Difference]: Finished difference. Result has 124 places, 190 transitions, 2396 flow [2023-08-31 23:28:59,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2396, PETRI_PLACES=124, PETRI_TRANSITIONS=190} [2023-08-31 23:28:59,630 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2023-08-31 23:28:59,630 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 190 transitions, 2396 flow [2023-08-31 23:28:59,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:59,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:59,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:59,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:28:59,631 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:28:59,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2124970197, now seen corresponding path program 1 times [2023-08-31 23:28:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698229700] [2023-08-31 23:28:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:59,713 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:28:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698229700] [2023-08-31 23:28:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698229700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:28:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225403326] [2023-08-31 23:28:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:59,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:59,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 347 [2023-08-31 23:28:59,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 190 transitions, 2396 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:59,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:59,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 347 [2023-08-31 23:28:59,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:01,838 INFO L130 PetriNetUnfolder]: 9660/14845 cut-off events. [2023-08-31 23:29:01,838 INFO L131 PetriNetUnfolder]: For 66216/66246 co-relation queries the response was YES. [2023-08-31 23:29:01,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71927 conditions, 14845 events. 9660/14845 cut-off events. For 66216/66246 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 101946 event pairs, 4805 based on Foata normal form. 565/15410 useless extension candidates. Maximal degree in co-relation 71884. Up to 12167 conditions per place. [2023-08-31 23:29:01,940 INFO L137 encePairwiseOnDemand]: 331/347 looper letters, 49 selfloop transitions, 1 changer transitions 138/189 dead transitions. [2023-08-31 23:29:01,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 189 transitions, 2740 flow [2023-08-31 23:29:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:29:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:29:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-31 23:29:01,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36527377521613835 [2023-08-31 23:29:01,942 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-31 23:29:01,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-31 23:29:01,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:01,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-31 23:29:01,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:01,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:01,944 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 347.0) internal successors, (1735), 5 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:01,945 INFO L175 Difference]: Start difference. First operand has 124 places, 190 transitions, 2396 flow. Second operand 4 states and 507 transitions. [2023-08-31 23:29:01,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 189 transitions, 2740 flow [2023-08-31 23:29:02,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 189 transitions, 2693 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-31 23:29:02,655 INFO L231 Difference]: Finished difference. Result has 118 places, 51 transitions, 503 flow [2023-08-31 23:29:02,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=2301, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=118, PETRI_TRANSITIONS=51} [2023-08-31 23:29:02,656 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2023-08-31 23:29:02,656 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 51 transitions, 503 flow [2023-08-31 23:29:02,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:02,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:02,656 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:29:02,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:29:02,656 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:02,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1111649795, now seen corresponding path program 1 times [2023-08-31 23:29:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113359899] [2023-08-31 23:29:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:04,070 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:29:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113359899] [2023-08-31 23:29:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113359899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:29:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622654601] [2023-08-31 23:29:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:04,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:29:04,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:04,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:29:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:29:04,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 347 [2023-08-31 23:29:04,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 51 transitions, 503 flow. Second operand has 10 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:04,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:04,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 347 [2023-08-31 23:29:04,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:04,856 INFO L130 PetriNetUnfolder]: 801/1314 cut-off events. [2023-08-31 23:29:04,856 INFO L131 PetriNetUnfolder]: For 8377/8377 co-relation queries the response was YES. [2023-08-31 23:29:04,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5516 conditions, 1314 events. 801/1314 cut-off events. For 8377/8377 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5942 event pairs, 371 based on Foata normal form. 30/1344 useless extension candidates. Maximal degree in co-relation 5475. Up to 1104 conditions per place. [2023-08-31 23:29:04,864 INFO L137 encePairwiseOnDemand]: 338/347 looper letters, 43 selfloop transitions, 17 changer transitions 16/77 dead transitions. [2023-08-31 23:29:04,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 77 transitions, 802 flow [2023-08-31 23:29:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:29:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:29:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1119 transitions. [2023-08-31 23:29:04,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32247838616714697 [2023-08-31 23:29:04,866 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1119 transitions. [2023-08-31 23:29:04,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1119 transitions. [2023-08-31 23:29:04,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:04,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1119 transitions. [2023-08-31 23:29:04,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 111.9) internal successors, (1119), 10 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:04,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 347.0) internal successors, (3817), 11 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:04,870 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 347.0) internal successors, (3817), 11 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:04,870 INFO L175 Difference]: Start difference. First operand has 118 places, 51 transitions, 503 flow. Second operand 10 states and 1119 transitions. [2023-08-31 23:29:04,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 77 transitions, 802 flow [2023-08-31 23:29:04,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 77 transitions, 707 flow, removed 24 selfloop flow, removed 15 redundant places. [2023-08-31 23:29:04,878 INFO L231 Difference]: Finished difference. Result has 94 places, 52 transitions, 488 flow [2023-08-31 23:29:04,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=488, PETRI_PLACES=94, PETRI_TRANSITIONS=52} [2023-08-31 23:29:04,879 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -4 predicate places. [2023-08-31 23:29:04,879 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 52 transitions, 488 flow [2023-08-31 23:29:04,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.5) internal successors, (1075), 10 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:04,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:04,880 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:29:04,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:29:04,880 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:04,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash 652993501, now seen corresponding path program 2 times [2023-08-31 23:29:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:04,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479674997] [2023-08-31 23:29:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:06,212 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:29:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:06,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479674997] [2023-08-31 23:29:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479674997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:29:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162610944] [2023-08-31 23:29:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:06,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:29:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:29:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:29:06,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-31 23:29:06,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 52 transitions, 488 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:06,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:06,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-31 23:29:06,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:07,169 INFO L130 PetriNetUnfolder]: 941/1536 cut-off events. [2023-08-31 23:29:07,169 INFO L131 PetriNetUnfolder]: For 6023/6023 co-relation queries the response was YES. [2023-08-31 23:29:07,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5878 conditions, 1536 events. 941/1536 cut-off events. For 6023/6023 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7164 event pairs, 215 based on Foata normal form. 30/1566 useless extension candidates. Maximal degree in co-relation 5846. Up to 962 conditions per place. [2023-08-31 23:29:07,177 INFO L137 encePairwiseOnDemand]: 338/347 looper letters, 56 selfloop transitions, 28 changer transitions 26/111 dead transitions. [2023-08-31 23:29:07,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 1060 flow [2023-08-31 23:29:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 23:29:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 23:29:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1475 transitions. [2023-08-31 23:29:07,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32697849700731546 [2023-08-31 23:29:07,179 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1475 transitions. [2023-08-31 23:29:07,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1475 transitions. [2023-08-31 23:29:07,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:07,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1475 transitions. [2023-08-31 23:29:07,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.46153846153847) internal successors, (1475), 13 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:07,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 347.0) internal successors, (4858), 14 states have internal predecessors, (4858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:07,185 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 347.0) internal successors, (4858), 14 states have internal predecessors, (4858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:07,185 INFO L175 Difference]: Start difference. First operand has 94 places, 52 transitions, 488 flow. Second operand 13 states and 1475 transitions. [2023-08-31 23:29:07,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 1060 flow [2023-08-31 23:29:07,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 111 transitions, 983 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-08-31 23:29:07,194 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 653 flow [2023-08-31 23:29:07,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=653, PETRI_PLACES=99, PETRI_TRANSITIONS=65} [2023-08-31 23:29:07,194 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2023-08-31 23:29:07,194 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 653 flow [2023-08-31 23:29:07,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:07,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:07,195 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:29:07,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 23:29:07,195 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:07,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1765424507, now seen corresponding path program 3 times [2023-08-31 23:29:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721703877] [2023-08-31 23:29:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:08,539 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:29:08,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721703877] [2023-08-31 23:29:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721703877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:29:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881085546] [2023-08-31 23:29:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:08,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:29:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:29:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:29:08,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-31 23:29:08,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 65 transitions, 653 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:08,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:08,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-31 23:29:08,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:09,526 INFO L130 PetriNetUnfolder]: 763/1267 cut-off events. [2023-08-31 23:29:09,527 INFO L131 PetriNetUnfolder]: For 4806/4806 co-relation queries the response was YES. [2023-08-31 23:29:09,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1267 events. 763/1267 cut-off events. For 4806/4806 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5711 event pairs, 227 based on Foata normal form. 30/1297 useless extension candidates. Maximal degree in co-relation 4985. Up to 853 conditions per place. [2023-08-31 23:29:09,534 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 50 selfloop transitions, 33 changer transitions 16/100 dead transitions. [2023-08-31 23:29:09,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 100 transitions, 1027 flow [2023-08-31 23:29:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 23:29:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 23:29:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1466 transitions. [2023-08-31 23:29:09,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32498337397472843 [2023-08-31 23:29:09,536 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1466 transitions. [2023-08-31 23:29:09,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1466 transitions. [2023-08-31 23:29:09,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:09,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1466 transitions. [2023-08-31 23:29:09,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.76923076923077) internal successors, (1466), 13 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:09,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 347.0) internal successors, (4858), 14 states have internal predecessors, (4858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:09,541 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 347.0) internal successors, (4858), 14 states have internal predecessors, (4858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:09,541 INFO L175 Difference]: Start difference. First operand has 99 places, 65 transitions, 653 flow. Second operand 13 states and 1466 transitions. [2023-08-31 23:29:09,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 100 transitions, 1027 flow [2023-08-31 23:29:09,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 100 transitions, 980 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-31 23:29:09,549 INFO L231 Difference]: Finished difference. Result has 107 places, 65 transitions, 709 flow [2023-08-31 23:29:09,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=709, PETRI_PLACES=107, PETRI_TRANSITIONS=65} [2023-08-31 23:29:09,550 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2023-08-31 23:29:09,550 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 65 transitions, 709 flow [2023-08-31 23:29:09,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:09,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:09,551 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:29:09,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-31 23:29:09,551 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:09,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash -289996037, now seen corresponding path program 4 times [2023-08-31 23:29:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662676926] [2023-08-31 23:29:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:10,152 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:29:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:10,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662676926] [2023-08-31 23:29:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662676926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:10,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:10,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:29:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564887396] [2023-08-31 23:29:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:10,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:29:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:29:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:29:10,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-31 23:29:10,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 65 transitions, 709 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:10,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:10,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-31 23:29:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:10,758 INFO L130 PetriNetUnfolder]: 828/1380 cut-off events. [2023-08-31 23:29:10,759 INFO L131 PetriNetUnfolder]: For 6063/6063 co-relation queries the response was YES. [2023-08-31 23:29:10,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 1380 events. 828/1380 cut-off events. For 6063/6063 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6475 event pairs, 256 based on Foata normal form. 30/1410 useless extension candidates. Maximal degree in co-relation 5470. Up to 670 conditions per place. [2023-08-31 23:29:10,766 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 53 selfloop transitions, 12 changer transitions 23/89 dead transitions. [2023-08-31 23:29:10,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 89 transitions, 1054 flow [2023-08-31 23:29:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:29:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:29:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 911 transitions. [2023-08-31 23:29:10,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3281700288184438 [2023-08-31 23:29:10,768 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 911 transitions. [2023-08-31 23:29:10,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 911 transitions. [2023-08-31 23:29:10,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:10,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 911 transitions. [2023-08-31 23:29:10,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:10,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 347.0) internal successors, (3123), 9 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:10,772 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 347.0) internal successors, (3123), 9 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:10,772 INFO L175 Difference]: Start difference. First operand has 107 places, 65 transitions, 709 flow. Second operand 8 states and 911 transitions. [2023-08-31 23:29:10,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 89 transitions, 1054 flow [2023-08-31 23:29:10,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 89 transitions, 968 flow, removed 22 selfloop flow, removed 9 redundant places. [2023-08-31 23:29:10,784 INFO L231 Difference]: Finished difference. Result has 104 places, 57 transitions, 595 flow [2023-08-31 23:29:10,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=595, PETRI_PLACES=104, PETRI_TRANSITIONS=57} [2023-08-31 23:29:10,785 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2023-08-31 23:29:10,785 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 57 transitions, 595 flow [2023-08-31 23:29:10,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:10,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:10,786 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:29:10,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-31 23:29:10,786 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:10,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1355948969, now seen corresponding path program 5 times [2023-08-31 23:29:10,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:10,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102431076] [2023-08-31 23:29:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:29:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102431076] [2023-08-31 23:29:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102431076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:29:11,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978766834] [2023-08-31 23:29:11,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:11,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:29:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:11,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:29:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:29:11,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 347 [2023-08-31 23:29:11,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 57 transitions, 595 flow. Second operand has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:11,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:11,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 347 [2023-08-31 23:29:11,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:12,056 INFO L130 PetriNetUnfolder]: 592/1012 cut-off events. [2023-08-31 23:29:12,056 INFO L131 PetriNetUnfolder]: For 3886/3886 co-relation queries the response was YES. [2023-08-31 23:29:12,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 1012 events. 592/1012 cut-off events. For 3886/3886 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4408 event pairs, 54 based on Foata normal form. 30/1042 useless extension candidates. Maximal degree in co-relation 3866. Up to 575 conditions per place. [2023-08-31 23:29:12,062 INFO L137 encePairwiseOnDemand]: 339/347 looper letters, 41 selfloop transitions, 22 changer transitions 13/77 dead transitions. [2023-08-31 23:29:12,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 77 transitions, 817 flow [2023-08-31 23:29:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:29:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:29:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1128 transitions. [2023-08-31 23:29:12,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32507204610951007 [2023-08-31 23:29:12,064 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1128 transitions. [2023-08-31 23:29:12,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1128 transitions. [2023-08-31 23:29:12,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:12,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1128 transitions. [2023-08-31 23:29:12,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 347.0) internal successors, (3817), 11 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,068 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 347.0) internal successors, (3817), 11 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,068 INFO L175 Difference]: Start difference. First operand has 104 places, 57 transitions, 595 flow. Second operand 10 states and 1128 transitions. [2023-08-31 23:29:12,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 77 transitions, 817 flow [2023-08-31 23:29:12,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 77 transitions, 736 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-08-31 23:29:12,073 INFO L231 Difference]: Finished difference. Result has 100 places, 49 transitions, 493 flow [2023-08-31 23:29:12,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=493, PETRI_PLACES=100, PETRI_TRANSITIONS=49} [2023-08-31 23:29:12,074 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2023-08-31 23:29:12,074 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 49 transitions, 493 flow [2023-08-31 23:29:12,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:12,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:12,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-31 23:29:12,075 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:12,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 970612043, now seen corresponding path program 1 times [2023-08-31 23:29:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:12,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369828155] [2023-08-31 23:29:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:12,300 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:29:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:12,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369828155] [2023-08-31 23:29:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369828155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:12,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:12,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:29:12,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188931581] [2023-08-31 23:29:12,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:12,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:12,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-31 23:29:12,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 49 transitions, 493 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:12,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-31 23:29:12,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:12,468 INFO L130 PetriNetUnfolder]: 412/781 cut-off events. [2023-08-31 23:29:12,469 INFO L131 PetriNetUnfolder]: For 2952/2961 co-relation queries the response was YES. [2023-08-31 23:29:12,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 781 events. 412/781 cut-off events. For 2952/2961 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3809 event pairs, 142 based on Foata normal form. 82/861 useless extension candidates. Maximal degree in co-relation 2875. Up to 523 conditions per place. [2023-08-31 23:29:12,472 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 59 selfloop transitions, 7 changer transitions 6/84 dead transitions. [2023-08-31 23:29:12,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 84 transitions, 856 flow [2023-08-31 23:29:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-31 23:29:12,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37175792507204614 [2023-08-31 23:29:12,473 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-31 23:29:12,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-31 23:29:12,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:12,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-31 23:29:12,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 347.0) internal successors, (2082), 6 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,475 INFO L175 Difference]: Start difference. First operand has 100 places, 49 transitions, 493 flow. Second operand 5 states and 645 transitions. [2023-08-31 23:29:12,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 84 transitions, 856 flow [2023-08-31 23:29:12,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 739 flow, removed 7 selfloop flow, removed 14 redundant places. [2023-08-31 23:29:12,479 INFO L231 Difference]: Finished difference. Result has 89 places, 53 transitions, 449 flow [2023-08-31 23:29:12,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=449, PETRI_PLACES=89, PETRI_TRANSITIONS=53} [2023-08-31 23:29:12,479 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -9 predicate places. [2023-08-31 23:29:12,479 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 53 transitions, 449 flow [2023-08-31 23:29:12,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:12,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:12,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-31 23:29:12,480 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:12,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 183269377, now seen corresponding path program 1 times [2023-08-31 23:29:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588222230] [2023-08-31 23:29:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:12,698 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:29:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588222230] [2023-08-31 23:29:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588222230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:12,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:12,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654832260] [2023-08-31 23:29:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:12,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:29:12,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:12,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:29:12,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:29:12,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-31 23:29:12,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 53 transitions, 449 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:29:12,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:12,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-31 23:29:12,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:12,933 INFO L130 PetriNetUnfolder]: 297/629 cut-off events. [2023-08-31 23:29:12,933 INFO L131 PetriNetUnfolder]: For 2013/2014 co-relation queries the response was YES. [2023-08-31 23:29:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 629 events. 297/629 cut-off events. For 2013/2014 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3248 event pairs, 25 based on Foata normal form. 54/681 useless extension candidates. Maximal degree in co-relation 2637. Up to 272 conditions per place. [2023-08-31 23:29:12,936 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 64 selfloop transitions, 13 changer transitions 9/95 dead transitions. [2023-08-31 23:29:12,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 95 transitions, 882 flow [2023-08-31 23:29:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 898 transitions. [2023-08-31 23:29:12,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36969946480032934 [2023-08-31 23:29:12,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 898 transitions. [2023-08-31 23:29:12,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 898 transitions. [2023-08-31 23:29:12,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:12,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 898 transitions. [2023-08-31 23:29:12,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,940 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 347.0) internal successors, (2776), 8 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:12,940 INFO L175 Difference]: Start difference. First operand has 89 places, 53 transitions, 449 flow. Second operand 7 states and 898 transitions. [2023-08-31 23:29:12,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 95 transitions, 882 flow [2023-08-31 23:29:12,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 836 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-31 23:29:12,943 INFO L231 Difference]: Finished difference. Result has 92 places, 54 transitions, 449 flow [2023-08-31 23:29:12,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=92, PETRI_TRANSITIONS=54} [2023-08-31 23:29:12,944 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -6 predicate places. [2023-08-31 23:29:12,944 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 54 transitions, 449 flow [2023-08-31 23:29:12,944 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:29:12,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:12,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:12,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-31 23:29:12,944 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:12,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2071740221, now seen corresponding path program 1 times [2023-08-31 23:29:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745780974] [2023-08-31 23:29:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:13,234 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:29:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745780974] [2023-08-31 23:29:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745780974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:13,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042963876] [2023-08-31 23:29:13,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:13,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:13,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 347 [2023-08-31 23:29:13,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 54 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:13,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:13,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 347 [2023-08-31 23:29:13,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:13,462 INFO L130 PetriNetUnfolder]: 257/559 cut-off events. [2023-08-31 23:29:13,462 INFO L131 PetriNetUnfolder]: For 2274/2274 co-relation queries the response was YES. [2023-08-31 23:29:13,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 559 events. 257/559 cut-off events. For 2274/2274 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2900 event pairs, 19 based on Foata normal form. 18/575 useless extension candidates. Maximal degree in co-relation 2577. Up to 240 conditions per place. [2023-08-31 23:29:13,465 INFO L137 encePairwiseOnDemand]: 341/347 looper letters, 61 selfloop transitions, 17 changer transitions 8/95 dead transitions. [2023-08-31 23:29:13,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 898 flow [2023-08-31 23:29:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:29:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:29:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1136 transitions. [2023-08-31 23:29:13,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637528017931476 [2023-08-31 23:29:13,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1136 transitions. [2023-08-31 23:29:13,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1136 transitions. [2023-08-31 23:29:13,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:13,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1136 transitions. [2023-08-31 23:29:13,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.22222222222223) internal successors, (1136), 9 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:13,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:13,469 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 347.0) internal successors, (3470), 10 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:13,470 INFO L175 Difference]: Start difference. First operand has 92 places, 54 transitions, 449 flow. Second operand 9 states and 1136 transitions. [2023-08-31 23:29:13,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 898 flow [2023-08-31 23:29:13,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 830 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-31 23:29:13,476 INFO L231 Difference]: Finished difference. Result has 98 places, 55 transitions, 458 flow [2023-08-31 23:29:13,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=347, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=458, PETRI_PLACES=98, PETRI_TRANSITIONS=55} [2023-08-31 23:29:13,476 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2023-08-31 23:29:13,477 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 55 transitions, 458 flow [2023-08-31 23:29:13,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:13,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:13,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:13,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-31 23:29:13,477 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:29:13,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1142924899, now seen corresponding path program 1 times [2023-08-31 23:29:13,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:13,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792491721] [2023-08-31 23:29:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:13,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:29:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:13,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:29:13,712 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:29:13,713 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-08-31 23:29:13,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-08-31 23:29:13,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-08-31 23:29:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-08-31 23:29:13,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-08-31 23:29:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-08-31 23:29:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-08-31 23:29:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-08-31 23:29:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-08-31 23:29:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-08-31 23:29:13,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-08-31 23:29:13,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-08-31 23:29:13,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-08-31 23:29:13,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-08-31 23:29:13,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-08-31 23:29:13,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-08-31 23:29:13,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-08-31 23:29:13,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-08-31 23:29:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-08-31 23:29:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-08-31 23:29:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-08-31 23:29:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-08-31 23:29:13,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-08-31 23:29:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-08-31 23:29:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-08-31 23:29:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-08-31 23:29:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-08-31 23:29:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-08-31 23:29:13,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-08-31 23:29:13,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-08-31 23:29:13,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-08-31 23:29:13,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-08-31 23:29:13,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-08-31 23:29:13,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-08-31 23:29:13,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-08-31 23:29:13,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-08-31 23:29:13,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-08-31 23:29:13,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-08-31 23:29:13,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-08-31 23:29:13,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-08-31 23:29:13,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-08-31 23:29:13,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-08-31 23:29:13,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-08-31 23:29:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-08-31 23:29:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-08-31 23:29:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-08-31 23:29:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-08-31 23:29:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-08-31 23:29:13,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-08-31 23:29:13,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-08-31 23:29:13,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-08-31 23:29:13,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-08-31 23:29:13,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-08-31 23:29:13,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-08-31 23:29:13,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-08-31 23:29:13,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-08-31 23:29:13,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-08-31 23:29:13,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-08-31 23:29:13,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-08-31 23:29:13,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-08-31 23:29:13,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-08-31 23:29:13,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-08-31 23:29:13,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-08-31 23:29:13,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-08-31 23:29:13,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-08-31 23:29:13,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-08-31 23:29:13,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-08-31 23:29:13,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-08-31 23:29:13,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-08-31 23:29:13,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-08-31 23:29:13,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-08-31 23:29:13,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-08-31 23:29:13,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-08-31 23:29:13,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-08-31 23:29:13,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-08-31 23:29:13,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-08-31 23:29:13,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-08-31 23:29:13,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-31 23:29:13,738 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:13,746 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:29:13,747 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:29:13,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:29:13 BasicIcfg [2023-08-31 23:29:13,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:29:13,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:29:13,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:29:13,847 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:29:13,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:47" (3/4) ... [2023-08-31 23:29:13,850 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:29:13,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:29:13,851 INFO L158 Benchmark]: Toolchain (without parser) took 88506.68ms. Allocated memory was 69.2MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 45.1MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 533.2MB. Max. memory is 16.1GB. [2023-08-31 23:29:13,851 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:13,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.39ms. Allocated memory was 69.2MB in the beginning and 115.3MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 82.2MB in the end (delta: -37.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-08-31 23:29:13,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 79.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:13,852 INFO L158 Benchmark]: Boogie Preprocessor took 48.67ms. Allocated memory is still 115.3MB. Free memory was 79.5MB in the beginning and 77.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:13,853 INFO L158 Benchmark]: RCFGBuilder took 1422.39ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 77.4MB in the beginning and 88.5MB in the end (delta: -11.1MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2023-08-31 23:29:13,854 INFO L158 Benchmark]: TraceAbstraction took 86399.37ms. Allocated memory was 144.7MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 87.4MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 497.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:13,854 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 4.4GB. Free memory is still 3.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:13,858 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.20ms. Allocated memory is still 69.2MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.39ms. Allocated memory was 69.2MB in the beginning and 115.3MB in the end (delta: 46.1MB). Free memory was 44.9MB in the beginning and 82.2MB in the end (delta: -37.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 115.3MB. Free memory was 82.2MB in the beginning and 79.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.67ms. Allocated memory is still 115.3MB. Free memory was 79.5MB in the beginning and 77.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1422.39ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 77.4MB in the beginning and 88.5MB in the end (delta: -11.1MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 86399.37ms. Allocated memory was 144.7MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 87.4MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 497.1MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 4.4GB. Free memory is still 3.9GB. 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: 20.0s, 194 PlacesBefore, 98 PlacesAfterwards, 186 TransitionsBefore, 89 TransitionsAfterwards, 8500 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 43557 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9786, independent: 9093, independent conditional: 0, independent unconditional: 9093, dependent: 693, dependent conditional: 0, dependent unconditional: 693, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3004, independent: 2910, independent conditional: 0, independent unconditional: 2910, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9786, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 599, dependent conditional: 0, dependent unconditional: 599, unknown: 3004, unknown conditional: 0, unknown unconditional: 3004] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 396, Positive conditional cache size: 0, Positive unconditional cache size: 396, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=0, t1789={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=1, t1789={6:0}, t1790={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=2, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 250 locations, 101 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: 86.1s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 47.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4077 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3124 mSDsluCounter, 2084 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1827 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9613 IncrementalHoareTripleChecker+Invalid, 10392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 257 mSDtfsCounter, 9613 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2396occurred in iteration=20, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 5060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:29:13,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.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 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --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:29:16,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:29:16,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:29:16,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:29:16,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:29:16,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:29:16,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:29:16,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:29:16,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:29:16,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:29:16,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:29:16,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:29:16,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:29:16,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:29:16,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:29:16,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:29:16,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:29:16,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:29:16,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:29:16,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:29:16,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:29:16,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:29:16,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:29:16,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:29:16,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:29:16,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:29:16,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:29:16,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:29:16,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:29:16,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:29:16,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:29:16,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:29:16,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:29:16,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:29:16,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:29:16,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:29:16,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:29:16,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:29:16,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:29:16,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:29:16,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:29:16,215 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:29:16,241 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:29:16,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:29:16,241 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:29:16,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:29:16,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:29:16,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:29:16,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:29:16,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:29:16,243 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:29:16,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:29:16,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:29:16,245 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:29:16,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:29:16,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:29:16,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:29:16,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:16,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:29:16,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:29:16,247 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:29:16,248 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 -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 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:29:16,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:29:16,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:29:16,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:29:16,558 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:29:16,558 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:29:16,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-08-31 23:29:17,667 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:29:17,978 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:29:17,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-08-31 23:29:18,002 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2417e33d6/34126c6348574928af12b01a566833bd/FLAGb8ebf8218 [2023-08-31 23:29:18,020 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2417e33d6/34126c6348574928af12b01a566833bd [2023-08-31 23:29:18,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:29:18,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:29:18,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:29:18,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:29:18,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:29:18,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a09ad5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18, skipping insertion in model container [2023-08-31 23:29:18,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:29:18,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:29:18,261 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/safe000_rmo.i[988,1001] [2023-08-31 23:29:18,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:29:18,543 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:29:18,552 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/safe000_rmo.i[988,1001] [2023-08-31 23:29:18,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:29:18,637 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:29:18,638 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:29:18,643 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:29:18,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18 WrapperNode [2023-08-31 23:29:18,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:29:18,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:29:18,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:29:18,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:29:18,652 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:29:18" (1/1) ... [2023-08-31 23:29:18,683 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:29:18" (1/1) ... [2023-08-31 23:29:18,714 INFO L138 Inliner]: procedures = 180, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 171 [2023-08-31 23:29:18,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:29:18,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:29:18,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:29:18,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:29:18,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,758 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:29:18,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:29:18,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:29:18,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:29:18,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (1/1) ... [2023-08-31 23:29:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:18,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:29:18,818 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:29:18,848 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:29:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:29:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:29:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:29:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:29:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:29:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:29:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:29:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:29:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:29:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:29:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:29:18,871 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:29:19,035 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:29:19,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:29:19,763 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:29:20,466 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:29:20,467 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:29:20,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:20 BoogieIcfgContainer [2023-08-31 23:29:20,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:29:20,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:29:20,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:29:20,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:29:20,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:29:18" (1/3) ... [2023-08-31 23:29:20,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ad86bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:29:20, skipping insertion in model container [2023-08-31 23:29:20,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:18" (2/3) ... [2023-08-31 23:29:20,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ad86bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:29:20, skipping insertion in model container [2023-08-31 23:29:20,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:20" (3/3) ... [2023-08-31 23:29:20,478 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-08-31 23:29:20,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:29:20,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-08-31 23:29:20,497 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:29:20,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:29:20,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 190 transitions, 395 flow [2023-08-31 23:29:20,755 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2023-08-31 23:29:20,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:20,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 355 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-31 23:29:20,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 190 transitions, 395 flow [2023-08-31 23:29:20,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 187 transitions, 383 flow [2023-08-31 23:29:20,770 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:29:20,787 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 187 transitions, 383 flow [2023-08-31 23:29:20,794 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 187 transitions, 383 flow [2023-08-31 23:29:20,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 187 transitions, 383 flow [2023-08-31 23:29:20,863 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2023-08-31 23:29:20,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:20,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-31 23:29:20,872 INFO L119 LiptonReduction]: Number of co-enabled transitions 8500 [2023-08-31 23:30:08,157 INFO L134 LiptonReduction]: Checked pairs total: 43248 [2023-08-31 23:30:08,157 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-31 23:30:08,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:30:08,173 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;@29c50f56, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:30:08,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-08-31 23:30:08,175 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:30:08,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:08,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:08,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:30:08,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:08,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1194, now seen corresponding path program 1 times [2023-08-31 23:30:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911378283] [2023-08-31 23:30:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:08,192 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:30:08,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:08,197 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:30:08,209 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:30:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:08,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:30:08,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:08,407 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:30:08,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:08,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:08,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911378283] [2023-08-31 23:30:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911378283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:30:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430017675] [2023-08-31 23:30:08,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:30:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:30:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:30:08,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 341 [2023-08-31 23:30:08,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:08,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:08,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 341 [2023-08-31 23:30:08,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:12,935 INFO L130 PetriNetUnfolder]: 18354/25862 cut-off events. [2023-08-31 23:30:12,935 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:30:12,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51649 conditions, 25862 events. 18354/25862 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 180997 event pairs, 18354 based on Foata normal form. 400/10667 useless extension candidates. Maximal degree in co-relation 51638. Up to 25691 conditions per place. [2023-08-31 23:30:13,116 INFO L137 encePairwiseOnDemand]: 303/341 looper letters, 45 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2023-08-31 23:30:13,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 201 flow [2023-08-31 23:30:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:30:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:30:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-08-31 23:30:13,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4970674486803519 [2023-08-31 23:30:13,136 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-08-31 23:30:13,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-08-31 23:30:13,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:13,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-08-31 23:30:13,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:13,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:13,221 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:13,222 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 339 transitions. [2023-08-31 23:30:13,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 201 flow [2023-08-31 23:30:13,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:13,232 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2023-08-31 23:30:13,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-31 23:30:13,238 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-31 23:30:13,239 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2023-08-31 23:30:13,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:13,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:13,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:30:13,255 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 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:30:13,452 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:30:13,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:13,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1180855, now seen corresponding path program 1 times [2023-08-31 23:30:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:13,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022232156] [2023-08-31 23:30:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:13,455 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:30:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:13,461 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:30:13,464 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:30:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:13,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:30:13,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:13,634 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 23:30:13,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-31 23:30:13,668 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:30:13,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:13,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022232156] [2023-08-31 23:30:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022232156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:13,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039527367] [2023-08-31 23:30:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:13,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:13,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:13,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 341 [2023-08-31 23:30:13,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:13,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:13,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 341 [2023-08-31 23:30:13,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:16,014 INFO L130 PetriNetUnfolder]: 9283/13254 cut-off events. [2023-08-31 23:30:16,015 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:30:16,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26511 conditions, 13254 events. 9283/13254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 85289 event pairs, 5915 based on Foata normal form. 584/7419 useless extension candidates. Maximal degree in co-relation 26508. Up to 6798 conditions per place. [2023-08-31 23:30:16,074 INFO L137 encePairwiseOnDemand]: 328/341 looper letters, 56 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-31 23:30:16,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 246 flow [2023-08-31 23:30:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-31 23:30:16,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217 [2023-08-31 23:30:16,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-31 23:30:16,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-31 23:30:16,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:16,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-31 23:30:16,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:16,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:16,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:16,085 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 438 transitions. [2023-08-31 23:30:16,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 246 flow [2023-08-31 23:30:16,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:30:16,087 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 124 flow [2023-08-31 23:30:16,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-08-31 23:30:16,089 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-08-31 23:30:16,089 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 124 flow [2023-08-31 23:30:16,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:16,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:16,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:30:16,101 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:30:16,303 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:30:16,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:16,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1180856, now seen corresponding path program 1 times [2023-08-31 23:30:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339043280] [2023-08-31 23:30:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:16,311 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:30:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:16,312 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:30:16,315 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:30:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:16,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:30:16,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:16,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:30:16,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:30:16,451 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:30:16,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:16,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339043280] [2023-08-31 23:30:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339043280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:30:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336858812] [2023-08-31 23:30:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:16,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:16,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 341 [2023-08-31 23:30:16,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:16,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:16,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 341 [2023-08-31 23:30:16,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:17,152 INFO L130 PetriNetUnfolder]: 2535/3803 cut-off events. [2023-08-31 23:30:17,152 INFO L131 PetriNetUnfolder]: For 437/546 co-relation queries the response was YES. [2023-08-31 23:30:17,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8556 conditions, 3803 events. 2535/3803 cut-off events. For 437/546 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 21628 event pairs, 2535 based on Foata normal form. 220/3311 useless extension candidates. Maximal degree in co-relation 8551. Up to 3702 conditions per place. [2023-08-31 23:30:17,171 INFO L137 encePairwiseOnDemand]: 330/341 looper letters, 31 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2023-08-31 23:30:17,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 170 flow [2023-08-31 23:30:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-31 23:30:17,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115347018572825 [2023-08-31 23:30:17,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-31 23:30:17,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-31 23:30:17,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:17,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-31 23:30:17,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,178 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 124 flow. Second operand 3 states and 421 transitions. [2023-08-31 23:30:17,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 170 flow [2023-08-31 23:30:17,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:17,182 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 100 flow [2023-08-31 23:30:17,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-31 23:30:17,184 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -49 predicate places. [2023-08-31 23:30:17,184 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 100 flow [2023-08-31 23:30:17,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:17,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:17,202 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:30:17,401 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:30:17,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:17,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1920053031, now seen corresponding path program 1 times [2023-08-31 23:30:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573230828] [2023-08-31 23:30:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:17,407 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:30:17,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:17,409 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:30:17,412 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:30:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:17,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:30:17,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:30:17,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:17,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573230828] [2023-08-31 23:30:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573230828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:30:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033571830] [2023-08-31 23:30:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:30:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:30:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:30:17,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-31 23:30:17,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:17,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-31 23:30:17,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:17,921 INFO L130 PetriNetUnfolder]: 950/1589 cut-off events. [2023-08-31 23:30:17,921 INFO L131 PetriNetUnfolder]: For 121/155 co-relation queries the response was YES. [2023-08-31 23:30:17,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1589 events. 950/1589 cut-off events. For 121/155 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8858 event pairs, 377 based on Foata normal form. 18/1336 useless extension candidates. Maximal degree in co-relation 3493. Up to 1464 conditions per place. [2023-08-31 23:30:17,928 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-31 23:30:17,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 224 flow [2023-08-31 23:30:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:30:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:30:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-31 23:30:17,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095796676441838 [2023-08-31 23:30:17,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-31 23:30:17,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-31 23:30:17,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:17,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-31 23:30:17,933 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:30:17,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,935 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 100 flow. Second operand 3 states and 419 transitions. [2023-08-31 23:30:17,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 224 flow [2023-08-31 23:30:17,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:17,937 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 125 flow [2023-08-31 23:30:17,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-31 23:30:17,938 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -48 predicate places. [2023-08-31 23:30:17,938 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 125 flow [2023-08-31 23:30:17,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:17,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:17,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:17,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-31 23:30:18,148 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:30:18,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:18,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 137123159, now seen corresponding path program 1 times [2023-08-31 23:30:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:18,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733294950] [2023-08-31 23:30:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:18,151 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:30:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:18,153 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:30:18,155 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:30:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:18,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:30:18,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:18,323 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:30:18,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:18,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733294950] [2023-08-31 23:30:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733294950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435017940] [2023-08-31 23:30:18,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:18,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:30:18,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:18,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:30:18,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:30:18,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-31 23:30:18,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:18,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:18,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-31 23:30:18,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:18,648 INFO L130 PetriNetUnfolder]: 212/434 cut-off events. [2023-08-31 23:30:18,648 INFO L131 PetriNetUnfolder]: For 68/72 co-relation queries the response was YES. [2023-08-31 23:30:18,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 434 events. 212/434 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1854 event pairs, 68 based on Foata normal form. 21/402 useless extension candidates. Maximal degree in co-relation 1065. Up to 246 conditions per place. [2023-08-31 23:30:18,650 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 50 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-31 23:30:18,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 295 flow [2023-08-31 23:30:18,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:30:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:30:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:30:18,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40615835777126097 [2023-08-31 23:30:18,655 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:30:18,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:30:18,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:18,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:30:18,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:18,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:18,660 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:18,660 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 125 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:30:18,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 295 flow [2023-08-31 23:30:18,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:30:18,665 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 161 flow [2023-08-31 23:30:18,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-31 23:30:18,667 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -45 predicate places. [2023-08-31 23:30:18,668 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 161 flow [2023-08-31 23:30:18,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:18,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:18,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:18,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-31 23:30:18,878 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:30:18,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:18,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1496010275, now seen corresponding path program 1 times [2023-08-31 23:30:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191146725] [2023-08-31 23:30:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:18,880 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:30:18,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:18,882 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:30:18,883 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:30:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:19,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:30:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:19,076 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:30:19,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:19,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:19,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191146725] [2023-08-31 23:30:19,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191146725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:19,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:19,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:30:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029370620] [2023-08-31 23:30:19,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:19,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:19,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-31 23:30:19,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:19,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:19,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-31 23:30:19,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:19,466 INFO L130 PetriNetUnfolder]: 114/230 cut-off events. [2023-08-31 23:30:19,466 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-31 23:30:19,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 230 events. 114/230 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 783 event pairs, 40 based on Foata normal form. 8/231 useless extension candidates. Maximal degree in co-relation 636. Up to 92 conditions per place. [2023-08-31 23:30:19,467 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 40 selfloop transitions, 10 changer transitions 1/54 dead transitions. [2023-08-31 23:30:19,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 275 flow [2023-08-31 23:30:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:30:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:30:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-31 23:30:19,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39413489736070384 [2023-08-31 23:30:19,469 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-31 23:30:19,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-31 23:30:19,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:19,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-31 23:30:19,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:19,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:19,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:19,475 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 161 flow. Second operand 5 states and 672 transitions. [2023-08-31 23:30:19,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 275 flow [2023-08-31 23:30:19,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 259 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:19,477 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2023-08-31 23:30:19,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-31 23:30:19,478 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2023-08-31 23:30:19,478 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2023-08-31 23:30:19,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:19,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:19,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:19,489 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 (7)] Ended with exit code 0 [2023-08-31 23:30:19,689 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:30:19,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:19,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 405329702, now seen corresponding path program 1 times [2023-08-31 23:30:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968123572] [2023-08-31 23:30:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:19,690 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:30:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:19,692 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:30:19,694 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:30:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:19,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-31 23:30:19,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:30:19,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:19,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:19,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968123572] [2023-08-31 23:30:19,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968123572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:19,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:19,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938170399] [2023-08-31 23:30:19,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:19,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:30:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:30:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:30:19,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 341 [2023-08-31 23:30:19,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:19,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:19,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 341 [2023-08-31 23:30:19,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:20,218 INFO L130 PetriNetUnfolder]: 168/348 cut-off events. [2023-08-31 23:30:20,219 INFO L131 PetriNetUnfolder]: For 390/390 co-relation queries the response was YES. [2023-08-31 23:30:20,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 348 events. 168/348 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1406 event pairs, 27 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 921. Up to 231 conditions per place. [2023-08-31 23:30:20,220 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 46 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-31 23:30:20,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 291 flow [2023-08-31 23:30:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:30:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:30:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-31 23:30:20,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2023-08-31 23:30:20,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-31 23:30:20,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-31 23:30:20,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:20,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-31 23:30:20,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,227 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,228 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 4 states and 517 transitions. [2023-08-31 23:30:20,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 291 flow [2023-08-31 23:30:20,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 259 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:20,231 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 115 flow [2023-08-31 23:30:20,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-31 23:30:20,232 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -53 predicate places. [2023-08-31 23:30:20,232 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 115 flow [2023-08-31 23:30:20,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:20,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:20,243 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:30:20,443 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:30:20,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:20,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash 176406831, now seen corresponding path program 1 times [2023-08-31 23:30:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798432227] [2023-08-31 23:30:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:20,445 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:30:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:20,447 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:30:20,488 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:30:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:20,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:30:20,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:20,729 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:30:20,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:20,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798432227] [2023-08-31 23:30:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798432227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:20,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511815341] [2023-08-31 23:30:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:20,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:20,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-08-31 23:30:20,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:20,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-08-31 23:30:20,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:20,984 INFO L130 PetriNetUnfolder]: 168/347 cut-off events. [2023-08-31 23:30:20,984 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-08-31 23:30:20,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 347 events. 168/347 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1400 event pairs, 27 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 900. Up to 233 conditions per place. [2023-08-31 23:30:20,986 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 45 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-31 23:30:20,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 259 flow [2023-08-31 23:30:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:30:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:30:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-31 23:30:20,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2023-08-31 23:30:20,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-31 23:30:20,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-31 23:30:20,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:20,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-31 23:30:20,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,993 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:20,993 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 115 flow. Second operand 4 states and 528 transitions. [2023-08-31 23:30:20,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 259 flow [2023-08-31 23:30:20,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:20,998 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 114 flow [2023-08-31 23:30:20,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:30:21,001 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -53 predicate places. [2023-08-31 23:30:21,001 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 114 flow [2023-08-31 23:30:21,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:21,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:21,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:21,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:30:21,212 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:30:21,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:21,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash 176407182, now seen corresponding path program 1 times [2023-08-31 23:30:21,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:21,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908539015] [2023-08-31 23:30:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:30:21,214 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:30:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:21,215 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:30:21,217 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:30:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:30:21,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:30:21,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:21,487 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:30:21,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:21,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908539015] [2023-08-31 23:30:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908539015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:21,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:30:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132075841] [2023-08-31 23:30:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:21,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:30:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:30:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:30:21,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 341 [2023-08-31 23:30:21,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:21,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:21,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 341 [2023-08-31 23:30:21,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:21,728 INFO L130 PetriNetUnfolder]: 205/404 cut-off events. [2023-08-31 23:30:21,728 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2023-08-31 23:30:21,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 404 events. 205/404 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1788 event pairs, 17 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1111. Up to 150 conditions per place. [2023-08-31 23:30:21,729 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 75 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-08-31 23:30:21,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 449 flow [2023-08-31 23:30:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:30:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:30:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-31 23:30:21,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39824046920821116 [2023-08-31 23:30:21,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-31 23:30:21,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-31 23:30:21,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:21,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-31 23:30:21,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:21,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:21,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:21,737 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 114 flow. Second operand 5 states and 679 transitions. [2023-08-31 23:30:21,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 449 flow [2023-08-31 23:30:21,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:21,739 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 127 flow [2023-08-31 23:30:21,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-31 23:30:21,740 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -50 predicate places. [2023-08-31 23:30:21,740 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 127 flow [2023-08-31 23:30:21,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:21,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:21,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:21,754 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:30:21,952 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:30:21,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:21,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash 359316678, now seen corresponding path program 2 times [2023-08-31 23:30:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806879616] [2023-08-31 23:30:21,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:30:21,953 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:30:21,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:21,954 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:30:21,955 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:30:22,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:30:22,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:22,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-31 23:30:22,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:22,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 23:30:22,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-31 23:30:22,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-31 23:30:22,604 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:30:22,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:22,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806879616] [2023-08-31 23:30:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806879616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:30:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949525821] [2023-08-31 23:30:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:22,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:30:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:30:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:30:22,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 341 [2023-08-31 23:30:22,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:22,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:22,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 341 [2023-08-31 23:30:22,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:23,213 INFO L130 PetriNetUnfolder]: 334/679 cut-off events. [2023-08-31 23:30:23,213 INFO L131 PetriNetUnfolder]: For 533/533 co-relation queries the response was YES. [2023-08-31 23:30:23,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 679 events. 334/679 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3354 event pairs, 51 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 2018. Up to 373 conditions per place. [2023-08-31 23:30:23,215 INFO L137 encePairwiseOnDemand]: 332/341 looper letters, 62 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-08-31 23:30:23,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 404 flow [2023-08-31 23:30:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:30:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:30:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions. [2023-08-31 23:30:23,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3587487781036168 [2023-08-31 23:30:23,218 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 734 transitions. [2023-08-31 23:30:23,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions. [2023-08-31 23:30:23,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:23,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions. [2023-08-31 23:30:23,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:23,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:23,222 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:23,222 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 127 flow. Second operand 6 states and 734 transitions. [2023-08-31 23:30:23,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 404 flow [2023-08-31 23:30:23,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 398 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:23,226 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 176 flow [2023-08-31 23:30:23,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-31 23:30:23,227 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -46 predicate places. [2023-08-31 23:30:23,227 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 176 flow [2023-08-31 23:30:23,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:23,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:23,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:23,237 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:30:23,436 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:30:23,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:23,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -222541424, now seen corresponding path program 3 times [2023-08-31 23:30:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652836545] [2023-08-31 23:30:23,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:30:23,438 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:30:23,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:23,439 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:30:23,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:30:23,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:30:23,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:23,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-31 23:30:23,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:24,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-31 23:30:25,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-31 23:30:25,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-08-31 23:30:25,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-08-31 23:30:25,711 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:30:25,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:25,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652836545] [2023-08-31 23:30:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652836545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:30:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270268019] [2023-08-31 23:30:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:25,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:30:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:30:25,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:30:26,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 341 [2023-08-31 23:30:26,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 176 flow. Second operand has 8 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:26,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:26,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 341 [2023-08-31 23:30:26,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:27,223 INFO L130 PetriNetUnfolder]: 366/753 cut-off events. [2023-08-31 23:30:27,223 INFO L131 PetriNetUnfolder]: For 919/919 co-relation queries the response was YES. [2023-08-31 23:30:27,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 753 events. 366/753 cut-off events. For 919/919 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3865 event pairs, 67 based on Foata normal form. 1/754 useless extension candidates. Maximal degree in co-relation 2511. Up to 363 conditions per place. [2023-08-31 23:30:27,226 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 76 selfloop transitions, 9 changer transitions 0/86 dead transitions. [2023-08-31 23:30:27,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 549 flow [2023-08-31 23:30:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:30:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:30:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-08-31 23:30:27,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552576455802262 [2023-08-31 23:30:27,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-08-31 23:30:27,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-08-31 23:30:27,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:27,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-08-31 23:30:27,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:27,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:27,235 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:27,236 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 176 flow. Second operand 7 states and 848 transitions. [2023-08-31 23:30:27,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 549 flow [2023-08-31 23:30:27,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:30:27,241 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 214 flow [2023-08-31 23:30:27,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-31 23:30:27,242 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -40 predicate places. [2023-08-31 23:30:27,242 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 214 flow [2023-08-31 23:30:27,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.625) internal successors, (917), 8 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:27,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:27,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:27,261 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:30:27,454 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:30:27,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:27,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 435493842, now seen corresponding path program 4 times [2023-08-31 23:30:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668327909] [2023-08-31 23:30:27,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:30:27,455 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:30:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:27,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:30:27,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:30:27,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:30:27,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:30:27,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-31 23:30:27,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:30:27,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:30:27,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 23:30:27,754 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-08-31 23:30:27,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-08-31 23:30:27,881 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-08-31 23:30:27,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-08-31 23:30:27,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 23:30:28,070 INFO L321 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2023-08-31 23:30:28,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2023-08-31 23:30:28,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 23:30:28,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2023-08-31 23:30:28,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-31 23:30:28,799 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:30:28,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:30:28,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:30:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668327909] [2023-08-31 23:30:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668327909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:30:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:30:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:30:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547863365] [2023-08-31 23:30:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:30:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:30:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:30:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:30:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:30:29,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 341 [2023-08-31 23:30:29,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:29,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:30:29,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 341 [2023-08-31 23:30:29,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:30:30,014 INFO L130 PetriNetUnfolder]: 420/845 cut-off events. [2023-08-31 23:30:30,014 INFO L131 PetriNetUnfolder]: For 1325/1325 co-relation queries the response was YES. [2023-08-31 23:30:30,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 845 events. 420/845 cut-off events. For 1325/1325 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4364 event pairs, 62 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 3083. Up to 499 conditions per place. [2023-08-31 23:30:30,018 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 82 selfloop transitions, 18 changer transitions 0/101 dead transitions. [2023-08-31 23:30:30,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 695 flow [2023-08-31 23:30:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:30:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:30:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1147 transitions. [2023-08-31 23:30:30,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2023-08-31 23:30:30,023 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1147 transitions. [2023-08-31 23:30:30,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1147 transitions. [2023-08-31 23:30:30,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:30:30,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1147 transitions. [2023-08-31 23:30:30,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:30,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:30,031 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 341.0) internal successors, (3751), 11 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:30,032 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 214 flow. Second operand 10 states and 1147 transitions. [2023-08-31 23:30:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 695 flow [2023-08-31 23:30:30,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 674 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:30:30,038 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 356 flow [2023-08-31 23:30:30,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=356, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-08-31 23:30:30,039 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -28 predicate places. [2023-08-31 23:30:30,039 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 356 flow [2023-08-31 23:30:30,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:30:30,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:30:30,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:30,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:30:30,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:30:30,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-31 23:30:30,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:30:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1761312588, now seen corresponding path program 5 times [2023-08-31 23:30:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:30:30,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765094824] [2023-08-31 23:30:30,252 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:30:30,252 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:30:30,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:30:30,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:30:30,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 23:30:30,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:30:30,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:30:30,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:30:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:30:30,695 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:30:30,695 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:30:30,696 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-08-31 23:30:30,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-08-31 23:30:30,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-08-31 23:30:30,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-08-31 23:30:30,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-08-31 23:30:30,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-08-31 23:30:30,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-08-31 23:30:30,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-08-31 23:30:30,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-08-31 23:30:30,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-08-31 23:30:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-08-31 23:30:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-08-31 23:30:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-08-31 23:30:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-08-31 23:30:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-08-31 23:30:30,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-08-31 23:30:30,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-08-31 23:30:30,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-08-31 23:30:30,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-08-31 23:30:30,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-08-31 23:30:30,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-08-31 23:30:30,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-08-31 23:30:30,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-08-31 23:30:30,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-08-31 23:30:30,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-08-31 23:30:30,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-08-31 23:30:30,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-08-31 23:30:30,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-08-31 23:30:30,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-08-31 23:30:30,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-08-31 23:30:30,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-08-31 23:30:30,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-08-31 23:30:30,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-08-31 23:30:30,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-08-31 23:30:30,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-08-31 23:30:30,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-08-31 23:30:30,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-08-31 23:30:30,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-08-31 23:30:30,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-08-31 23:30:30,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-08-31 23:30:30,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-08-31 23:30:30,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-08-31 23:30:30,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-08-31 23:30:30,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-08-31 23:30:30,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-08-31 23:30:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-08-31 23:30:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-08-31 23:30:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-08-31 23:30:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-08-31 23:30:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-08-31 23:30:30,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-08-31 23:30:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-08-31 23:30:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-08-31 23:30:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-08-31 23:30:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-08-31 23:30:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-08-31 23:30:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-08-31 23:30:30,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-08-31 23:30:30,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-08-31 23:30:30,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-08-31 23:30:30,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-08-31 23:30:30,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-08-31 23:30:30,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-08-31 23:30:30,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-08-31 23:30:30,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-08-31 23:30:30,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-08-31 23:30:30,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-08-31 23:30:30,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-08-31 23:30:30,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-08-31 23:30:30,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-08-31 23:30:30,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-08-31 23:30:30,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-08-31 23:30:30,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-08-31 23:30:30,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-08-31 23:30:30,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-08-31 23:30:30,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-08-31 23:30:30,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-08-31 23:30:30,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-08-31 23:30:30,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-08-31 23:30:30,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-08-31 23:30:30,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-08-31 23:30:30,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-08-31 23:30:30,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-08-31 23:30:30,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-08-31 23:30:30,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-08-31 23:30:30,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-08-31 23:30:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-08-31 23:30:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-08-31 23:30:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-08-31 23:30:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-08-31 23:30:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-08-31 23:30:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-08-31 23:30:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-08-31 23:30:30,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-08-31 23:30:30,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-08-31 23:30:30,732 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 (14)] Ended with exit code 0 [2023-08-31 23:30:30,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:30:30,927 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:30:30,933 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:30:30,933 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:30:31,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:30:31 BasicIcfg [2023-08-31 23:30:31,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:30:31,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:30:31,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:30:31,031 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:30:31,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:20" (3/4) ... [2023-08-31 23:30:31,034 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:30:31,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:30:31,034 INFO L158 Benchmark]: Toolchain (without parser) took 73010.93ms. Allocated memory was 71.3MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 48.1MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-31 23:30:31,035 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:30:31,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.48ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 38.7MB in the end (delta: 9.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:30:31,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.62ms. Allocated memory is still 71.3MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:30:31,036 INFO L158 Benchmark]: Boogie Preprocessor took 48.45ms. Allocated memory is still 71.3MB. Free memory was 35.8MB in the beginning and 33.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:30:31,036 INFO L158 Benchmark]: RCFGBuilder took 1704.75ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 33.2MB in the beginning and 44.9MB in the end (delta: -11.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-08-31 23:30:31,036 INFO L158 Benchmark]: TraceAbstraction took 70558.10ms. Allocated memory was 104.9MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 44.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-31 23:30:31,036 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 4.5GB. Free memory is still 2.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:30:31,039 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.48ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 38.7MB in the end (delta: 9.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.62ms. Allocated memory is still 71.3MB. Free memory was 38.7MB in the beginning and 35.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.45ms. Allocated memory is still 71.3MB. Free memory was 35.8MB in the beginning and 33.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1704.75ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 33.2MB in the beginning and 44.9MB in the end (delta: -11.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 70558.10ms. Allocated memory was 104.9MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 44.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 4.5GB. Free memory is still 2.6GB. 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: 47.4s, 195 PlacesBefore, 98 PlacesAfterwards, 187 TransitionsBefore, 89 TransitionsAfterwards, 8500 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 151 TotalNumberOfCompositions, 43248 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9964, independent: 9278, independent conditional: 0, independent unconditional: 9278, dependent: 686, dependent conditional: 0, dependent unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3071, independent: 2977, independent conditional: 0, independent unconditional: 2977, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9964, independent: 6301, independent conditional: 0, independent unconditional: 6301, dependent: 592, dependent conditional: 0, dependent unconditional: 592, unknown: 3071, unknown conditional: 0, unknown unconditional: 3071] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=0, t1789={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={15:0}, t1790={23:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=1, t1789={15:0}, t1790={23:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={15:0}, t1790={23:0}, t1791={7:0}, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=2, t1789={15:0}, t1790={23:0}, t1791={7:0}, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={15:0}, t1790={23:0}, t1791={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 251 locations, 101 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: 70.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.5s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1204 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 743 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2201 IncrementalHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 263 mSDtfsCounter, 2201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=12, InterpolantAutomatonStates: 56, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 5 QuantifiedInterpolants, 1994 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2030 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:30:31,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample