./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --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:09,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:27:09,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:27:09,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:27:09,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:27:09,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:27:09,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:27:09,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:27:09,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:27:09,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:27:09,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:27:09,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:27:09,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:27:09,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:27:09,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:27:09,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:27:09,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:27:09,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:27:09,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:27:09,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:27:09,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:27:09,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:27:09,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:27:09,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:27:09,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:27:09,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:27:09,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:27:09,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:27:09,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:27:09,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:27:09,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:27:09,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:27:09,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:27:09,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:27:09,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:27:09,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:27:09,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:27:09,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:27:09,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:27:09,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:27:09,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:27:09,434 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:09,469 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:27:09,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:27:09,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:27:09,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:27:09,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:27:09,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:27:09,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:27:09,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:27:09,473 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:27:09,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:27:09,474 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:27:09,474 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:27:09,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:27:09,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:27:09,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:27:09,475 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:27:09,475 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:27:09,475 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:27:09,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:27:09,476 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:27:09,476 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:27:09,476 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:27:09,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:27:09,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:27:09,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:27:09,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:27:09,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:27:09,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:27:09,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:27:09,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:27:09,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:27:09,478 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:27:09,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:27:09,479 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:27:09,479 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 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:09,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:27:09,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:27:09,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:27:09,783 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:27:09,783 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:27:09,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-31 23:27:11,013 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:27:11,324 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:27:11,325 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-31 23:27:11,338 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472df9289/149a3d3ff8714383ac07e87fbab0c40d/FLAG6aac99f3f [2023-08-31 23:27:11,352 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472df9289/149a3d3ff8714383ac07e87fbab0c40d [2023-08-31 23:27:11,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:27:11,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:27:11,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:27:11,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:27:11,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:27:11,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:27:11" (1/1) ... [2023-08-31 23:27:11,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dfb0810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:11, skipping insertion in model container [2023-08-31 23:27:11,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:27:11" (1/1) ... [2023-08-31 23:27:11,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:27:11,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:27:11,617 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/rfi009_rmo.oepc.i[992,1005] [2023-08-31 23:27:11,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:27:11,909 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:27:11,923 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/rfi009_rmo.oepc.i[992,1005] [2023-08-31 23:27:11,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:27:12,021 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:27:12,022 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:27:12,027 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:27:12,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:12 WrapperNode [2023-08-31 23:27:12,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:27:12,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:27:12,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:27:12,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:27:12,035 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:12" (1/1) ... [2023-08-31 23:27:12,066 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:12" (1/1) ... [2023-08-31 23:27:12,102 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-31 23:27:12,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:27:12,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:27:12,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:27:12,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:27:12,112 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:12" (1/1) ... [2023-08-31 23:27:12,113 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:12" (1/1) ... [2023-08-31 23:27:12,124 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:12" (1/1) ... [2023-08-31 23:27:12,124 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:12" (1/1) ... [2023-08-31 23:27:12,132 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:12" (1/1) ... [2023-08-31 23:27:12,144 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:12" (1/1) ... [2023-08-31 23:27:12,149 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:12" (1/1) ... [2023-08-31 23:27:12,152 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:12" (1/1) ... [2023-08-31 23:27:12,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:27:12,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:27:12,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:27:12,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:27:12,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:12" (1/1) ... [2023-08-31 23:27:12,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:27:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:27:12,218 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:12,241 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:12,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:27:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:27:12,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:27:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:27:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:27:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:27:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:27:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:27:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:27:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:27:12,268 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:27:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:27:12,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:27:12,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:27:12,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:27:12,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:27:12,270 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:12,433 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:27:12,444 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:27:12,957 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:27:13,402 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:27:13,403 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:27:13,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:13 BoogieIcfgContainer [2023-08-31 23:27:13,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:27:13,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:27:13,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:27:13,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:27:13,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:27:11" (1/3) ... [2023-08-31 23:27:13,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174b6486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:27:13, skipping insertion in model container [2023-08-31 23:27:13,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:27:12" (2/3) ... [2023-08-31 23:27:13,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174b6486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:27:13, skipping insertion in model container [2023-08-31 23:27:13,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:27:13" (3/3) ... [2023-08-31 23:27:13,414 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-08-31 23:27:13,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:27:13,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-31 23:27:13,432 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:27:13,560 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:27:13,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2023-08-31 23:27:13,698 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-31 23:27:13,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:27:13,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 242 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-31 23:27:13,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2023-08-31 23:27:13,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2023-08-31 23:27:13,722 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:27:13,737 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-31 23:27:13,740 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2023-08-31 23:27:13,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2023-08-31 23:27:13,796 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2023-08-31 23:27:13,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:27:13,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 244 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-31 23:27:13,803 INFO L119 LiptonReduction]: Number of co-enabled transitions 6286 [2023-08-31 23:27:20,761 INFO L134 LiptonReduction]: Checked pairs total: 30012 [2023-08-31 23:27:20,761 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-31 23:27:20,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:27:20,780 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;@78804340, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:27:20,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-08-31 23:27:20,785 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:27:20,785 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:27:20,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:20,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:27:20,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:20,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2023-08-31 23:27:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124353254] [2023-08-31 23:27:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:20,923 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:27:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124353254] [2023-08-31 23:27:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124353254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:20,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:27:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610476910] [2023-08-31 23:27:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:20,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:27:20,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:20,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:27:20,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:27:20,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 314 [2023-08-31 23:27:20,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:20,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:20,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 314 [2023-08-31 23:27:20,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:23,229 INFO L130 PetriNetUnfolder]: 11260/15873 cut-off events. [2023-08-31 23:27:23,229 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:27:23,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31816 conditions, 15873 events. 11260/15873 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 99965 event pairs, 11260 based on Foata normal form. 0/7395 useless extension candidates. Maximal degree in co-relation 31805. Up to 15867 conditions per place. [2023-08-31 23:27:23,359 INFO L137 encePairwiseOnDemand]: 288/314 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-31 23:27:23,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-31 23:27:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:27:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:27:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 318 transitions. [2023-08-31 23:27:23,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063694267515924 [2023-08-31 23:27:23,379 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 318 transitions. [2023-08-31 23:27:23,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 318 transitions. [2023-08-31 23:27:23,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:23,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 318 transitions. [2023-08-31 23:27:23,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:23,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:23,392 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:23,394 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 2 states and 318 transitions. [2023-08-31 23:27:23,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-31 23:27:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:27:23,400 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-31 23:27:23,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-31 23:27:23,405 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -28 predicate places. [2023-08-31 23:27:23,405 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-31 23:27:23,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:23,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:23,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:27:23,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:27:23,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:23,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash 960548, now seen corresponding path program 1 times [2023-08-31 23:27:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639253913] [2023-08-31 23:27:23,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:23,644 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:27:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639253913] [2023-08-31 23:27:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639253913] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:27:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329601614] [2023-08-31 23:27:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:23,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:27:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:27:23,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:27:23,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 314 [2023-08-31 23:27:23,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:23,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:23,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 314 [2023-08-31 23:27:23,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:25,200 INFO L130 PetriNetUnfolder]: 7440/11019 cut-off events. [2023-08-31 23:27:25,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:27:25,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22005 conditions, 11019 events. 7440/11019 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 70980 event pairs, 4668 based on Foata normal form. 0/6425 useless extension candidates. Maximal degree in co-relation 22002. Up to 6813 conditions per place. [2023-08-31 23:27:25,248 INFO L137 encePairwiseOnDemand]: 298/314 looper letters, 45 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-08-31 23:27:25,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 226 flow [2023-08-31 23:27:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:27:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:27:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-31 23:27:25,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469214437367304 [2023-08-31 23:27:25,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-31 23:27:25,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-31 23:27:25,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:25,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-31 23:27:25,253 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:27:25,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:25,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:25,258 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 421 transitions. [2023-08-31 23:27:25,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 226 flow [2023-08-31 23:27:25,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:27:25,260 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 160 flow [2023-08-31 23:27:25,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-31 23:27:25,261 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2023-08-31 23:27:25,261 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 160 flow [2023-08-31 23:27:25,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:25,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:25,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:27:25,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:27:25,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:25,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 960549, now seen corresponding path program 1 times [2023-08-31 23:27:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147657118] [2023-08-31 23:27:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:25,403 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:27:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147657118] [2023-08-31 23:27:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147657118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:27:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487045075] [2023-08-31 23:27:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:25,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:27:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:27:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:27:25,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 314 [2023-08-31 23:27:25,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 160 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:27:25,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:25,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 314 [2023-08-31 23:27:25,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:25,984 INFO L130 PetriNetUnfolder]: 2598/4056 cut-off events. [2023-08-31 23:27:25,985 INFO L131 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2023-08-31 23:27:25,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11323 conditions, 4056 events. 2598/4056 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23864 event pairs, 1942 based on Foata normal form. 1105/4677 useless extension candidates. Maximal degree in co-relation 11318. Up to 4004 conditions per place. [2023-08-31 23:27:26,011 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-31 23:27:26,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 222 flow [2023-08-31 23:27:26,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:27:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:27:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-31 23:27:26,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43524416135881105 [2023-08-31 23:27:26,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-31 23:27:26,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-31 23:27:26,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:26,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-31 23:27:26,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,018 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 160 flow. Second operand 3 states and 410 transitions. [2023-08-31 23:27:26,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 222 flow [2023-08-31 23:27:26,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:27:26,032 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 130 flow [2023-08-31 23:27:26,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-31 23:27:26,033 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-31 23:27:26,036 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 130 flow [2023-08-31 23:27:26,037 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:27:26,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:26,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:26,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:27:26,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:26,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1364936896, now seen corresponding path program 1 times [2023-08-31 23:27:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727520497] [2023-08-31 23:27:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:26,185 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:27:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727520497] [2023-08-31 23:27:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727520497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:27:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44402771] [2023-08-31 23:27:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:26,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:27:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:27:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:27:26,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 314 [2023-08-31 23:27:26,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:26,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 314 [2023-08-31 23:27:26,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:26,695 INFO L130 PetriNetUnfolder]: 2518/4058 cut-off events. [2023-08-31 23:27:26,696 INFO L131 PetriNetUnfolder]: For 488/491 co-relation queries the response was YES. [2023-08-31 23:27:26,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10349 conditions, 4058 events. 2518/4058 cut-off events. For 488/491 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25047 event pairs, 1068 based on Foata normal form. 0/3197 useless extension candidates. Maximal degree in co-relation 10344. Up to 2515 conditions per place. [2023-08-31 23:27:26,717 INFO L137 encePairwiseOnDemand]: 310/314 looper letters, 65 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-31 23:27:26,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 364 flow [2023-08-31 23:27:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:27:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:27:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-31 23:27:26,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585987261146497 [2023-08-31 23:27:26,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-31 23:27:26,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-31 23:27:26,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:26,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-31 23:27:26,721 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:27:26,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,724 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 130 flow. Second operand 3 states and 432 transitions. [2023-08-31 23:27:26,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 364 flow [2023-08-31 23:27:26,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:27:26,726 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 142 flow [2023-08-31 23:27:26,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-31 23:27:26,727 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2023-08-31 23:27:26,727 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 142 flow [2023-08-31 23:27:26,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:26,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:26,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:26,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:27:26,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:26,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1364937120, now seen corresponding path program 1 times [2023-08-31 23:27:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:26,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531362789] [2023-08-31 23:27:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:26,942 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:27:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531362789] [2023-08-31 23:27:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531362789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:26,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:27:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818388691] [2023-08-31 23:27:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:26,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:27:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:27:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:27:26,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 314 [2023-08-31 23:27:26,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 142 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:27:26,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:26,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 314 [2023-08-31 23:27:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:27,537 INFO L130 PetriNetUnfolder]: 3060/4737 cut-off events. [2023-08-31 23:27:27,537 INFO L131 PetriNetUnfolder]: For 1236/1236 co-relation queries the response was YES. [2023-08-31 23:27:27,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13044 conditions, 4737 events. 3060/4737 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 28444 event pairs, 948 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 13038. Up to 3264 conditions per place. [2023-08-31 23:27:27,563 INFO L137 encePairwiseOnDemand]: 311/314 looper letters, 64 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-31 23:27:27,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 374 flow [2023-08-31 23:27:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:27:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:27:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-31 23:27:27,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45222929936305734 [2023-08-31 23:27:27,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-31 23:27:27,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-31 23:27:27,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:27,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-31 23:27:27,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:27,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:27,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:27,570 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 142 flow. Second operand 3 states and 426 transitions. [2023-08-31 23:27:27,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 374 flow [2023-08-31 23:27:27,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:27:27,573 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 144 flow [2023-08-31 23:27:27,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-31 23:27:27,574 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -30 predicate places. [2023-08-31 23:27:27,574 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 144 flow [2023-08-31 23:27:27,575 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:27:27,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:27,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:27:27,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:27,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 950502690, now seen corresponding path program 1 times [2023-08-31 23:27:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299382693] [2023-08-31 23:27:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:27,778 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:27:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:27,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299382693] [2023-08-31 23:27:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299382693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:27:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220431032] [2023-08-31 23:27:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:27,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:27:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:27:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:27:27,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 314 [2023-08-31 23:27:27,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:27,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:27,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 314 [2023-08-31 23:27:27,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:28,528 INFO L130 PetriNetUnfolder]: 2425/3987 cut-off events. [2023-08-31 23:27:28,529 INFO L131 PetriNetUnfolder]: For 499/502 co-relation queries the response was YES. [2023-08-31 23:27:28,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10503 conditions, 3987 events. 2425/3987 cut-off events. For 499/502 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 25501 event pairs, 747 based on Foata normal form. 0/3238 useless extension candidates. Maximal degree in co-relation 10496. Up to 1468 conditions per place. [2023-08-31 23:27:28,550 INFO L137 encePairwiseOnDemand]: 304/314 looper letters, 61 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2023-08-31 23:27:28,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 390 flow [2023-08-31 23:27:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:27:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:27:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-31 23:27:28,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.410828025477707 [2023-08-31 23:27:28,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-31 23:27:28,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-31 23:27:28,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:28,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-31 23:27:28,556 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:27:28,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:28,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:28,560 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 144 flow. Second operand 5 states and 645 transitions. [2023-08-31 23:27:28,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 390 flow [2023-08-31 23:27:28,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:27:28,562 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 214 flow [2023-08-31 23:27:28,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-31 23:27:28,563 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2023-08-31 23:27:28,564 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 214 flow [2023-08-31 23:27:28,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:28,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:28,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:27:28,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:28,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash -636623371, now seen corresponding path program 1 times [2023-08-31 23:27:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:28,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198138115] [2023-08-31 23:27:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:28,784 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:27:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198138115] [2023-08-31 23:27:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198138115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:27:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777086507] [2023-08-31 23:27:28,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:27:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:28,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:27:28,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:27:28,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 314 [2023-08-31 23:27:28,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 214 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:27:28,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:28,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 314 [2023-08-31 23:27:28,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:29,683 INFO L130 PetriNetUnfolder]: 3579/5704 cut-off events. [2023-08-31 23:27:29,684 INFO L131 PetriNetUnfolder]: For 3480/3483 co-relation queries the response was YES. [2023-08-31 23:27:29,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17012 conditions, 5704 events. 3579/5704 cut-off events. For 3480/3483 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 37292 event pairs, 1256 based on Foata normal form. 32/5241 useless extension candidates. Maximal degree in co-relation 17003. Up to 3175 conditions per place. [2023-08-31 23:27:29,712 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 75 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-31 23:27:29,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 550 flow [2023-08-31 23:27:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:27:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:27:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2023-08-31 23:27:29,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41847133757961785 [2023-08-31 23:27:29,715 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2023-08-31 23:27:29,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2023-08-31 23:27:29,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:29,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2023-08-31 23:27:29,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:29,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:29,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:29,720 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 214 flow. Second operand 5 states and 657 transitions. [2023-08-31 23:27:29,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 550 flow [2023-08-31 23:27:29,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 545 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:27:29,745 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 278 flow [2023-08-31 23:27:29,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-31 23:27:29,746 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2023-08-31 23:27:29,746 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 278 flow [2023-08-31 23:27:29,746 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:27:29,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:29,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:29,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:27:29,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:29,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:29,747 INFO L85 PathProgramCache]: Analyzing trace with hash -138337345, now seen corresponding path program 2 times [2023-08-31 23:27:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:29,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257585285] [2023-08-31 23:27:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:30,068 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:27:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257585285] [2023-08-31 23:27:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257585285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:27:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229051832] [2023-08-31 23:27:30,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:27:30,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:27:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:27:30,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 314 [2023-08-31 23:27:30,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:30,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:30,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 314 [2023-08-31 23:27:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:30,784 INFO L130 PetriNetUnfolder]: 3515/5608 cut-off events. [2023-08-31 23:27:30,784 INFO L131 PetriNetUnfolder]: For 5236/5248 co-relation queries the response was YES. [2023-08-31 23:27:30,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17685 conditions, 5608 events. 3515/5608 cut-off events. For 5236/5248 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 36651 event pairs, 1242 based on Foata normal form. 34/5149 useless extension candidates. Maximal degree in co-relation 17674. Up to 4014 conditions per place. [2023-08-31 23:27:30,813 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 74 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-08-31 23:27:30,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 562 flow [2023-08-31 23:27:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:27:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:27:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-31 23:27:30,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4210191082802548 [2023-08-31 23:27:30,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-31 23:27:30,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-31 23:27:30,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:30,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-31 23:27:30,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:30,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:30,820 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:30,821 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 278 flow. Second operand 5 states and 661 transitions. [2023-08-31 23:27:30,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 562 flow [2023-08-31 23:27:30,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 542 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 23:27:30,851 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 319 flow [2023-08-31 23:27:30,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2023-08-31 23:27:30,852 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2023-08-31 23:27:30,852 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 319 flow [2023-08-31 23:27:30,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:30,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:30,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:27:30,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:30,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash 967813466, now seen corresponding path program 1 times [2023-08-31 23:27:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179515234] [2023-08-31 23:27:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:31,080 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:27:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:31,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179515234] [2023-08-31 23:27:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179515234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:31,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:27:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740039732] [2023-08-31 23:27:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:31,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:27:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:27:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:27:31,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 314 [2023-08-31 23:27:31,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 319 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:27:31,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:31,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 314 [2023-08-31 23:27:31,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:31,661 INFO L130 PetriNetUnfolder]: 3486/5566 cut-off events. [2023-08-31 23:27:31,661 INFO L131 PetriNetUnfolder]: For 6427/6433 co-relation queries the response was YES. [2023-08-31 23:27:31,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17572 conditions, 5566 events. 3486/5566 cut-off events. For 6427/6433 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 36540 event pairs, 1560 based on Foata normal form. 14/5086 useless extension candidates. Maximal degree in co-relation 17561. Up to 4087 conditions per place. [2023-08-31 23:27:31,680 INFO L137 encePairwiseOnDemand]: 311/314 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-31 23:27:31,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 543 flow [2023-08-31 23:27:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:27:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:27:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-31 23:27:31,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575371549893843 [2023-08-31 23:27:31,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-31 23:27:31,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-31 23:27:31,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:31,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-31 23:27:31,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:31,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:31,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:31,686 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 319 flow. Second operand 3 states and 431 transitions. [2023-08-31 23:27:31,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 543 flow [2023-08-31 23:27:31,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:27:31,710 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 328 flow [2023-08-31 23:27:31,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-08-31 23:27:31,711 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2023-08-31 23:27:31,711 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 328 flow [2023-08-31 23:27:31,712 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:27:31,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:31,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:31,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:27:31,712 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:31,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1739536172, now seen corresponding path program 1 times [2023-08-31 23:27:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:31,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958679329] [2023-08-31 23:27:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:31,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:27:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:31,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958679329] [2023-08-31 23:27:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958679329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:31,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:31,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:27:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190145297] [2023-08-31 23:27:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:31,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:27:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:27:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:27:31,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 314 [2023-08-31 23:27:31,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:31,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:31,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 314 [2023-08-31 23:27:31,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:32,492 INFO L130 PetriNetUnfolder]: 3065/4865 cut-off events. [2023-08-31 23:27:32,492 INFO L131 PetriNetUnfolder]: For 5975/5985 co-relation queries the response was YES. [2023-08-31 23:27:32,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16084 conditions, 4865 events. 3065/4865 cut-off events. For 5975/5985 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 30518 event pairs, 1153 based on Foata normal form. 78/4479 useless extension candidates. Maximal degree in co-relation 16072. Up to 1952 conditions per place. [2023-08-31 23:27:32,512 INFO L137 encePairwiseOnDemand]: 301/314 looper letters, 58 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2023-08-31 23:27:32,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 574 flow [2023-08-31 23:27:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:27:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:27:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-31 23:27:32,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.410828025477707 [2023-08-31 23:27:32,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-31 23:27:32,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-31 23:27:32,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:32,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-31 23:27:32,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:32,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:32,519 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:32,519 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 328 flow. Second operand 4 states and 516 transitions. [2023-08-31 23:27:32,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 574 flow [2023-08-31 23:27:32,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:27:32,545 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 446 flow [2023-08-31 23:27:32,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=446, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2023-08-31 23:27:32,546 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2023-08-31 23:27:32,546 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 446 flow [2023-08-31 23:27:32,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:32,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:32,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:32,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:27:32,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:32,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1366221054, now seen corresponding path program 1 times [2023-08-31 23:27:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902053780] [2023-08-31 23:27:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:33,932 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:27:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902053780] [2023-08-31 23:27:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902053780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:33,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:27:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284986015] [2023-08-31 23:27:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:33,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:27:33,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:27:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:27:34,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 314 [2023-08-31 23:27:34,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 446 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:27:34,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:34,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 314 [2023-08-31 23:27:34,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:34,864 INFO L130 PetriNetUnfolder]: 3212/5074 cut-off events. [2023-08-31 23:27:34,864 INFO L131 PetriNetUnfolder]: For 7357/7367 co-relation queries the response was YES. [2023-08-31 23:27:34,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18626 conditions, 5074 events. 3212/5074 cut-off events. For 7357/7367 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 31694 event pairs, 825 based on Foata normal form. 5/4605 useless extension candidates. Maximal degree in co-relation 18613. Up to 4339 conditions per place. [2023-08-31 23:27:34,888 INFO L137 encePairwiseOnDemand]: 302/314 looper letters, 98 selfloop transitions, 59 changer transitions 0/159 dead transitions. [2023-08-31 23:27:34,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 159 transitions, 1380 flow [2023-08-31 23:27:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:27:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:27:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1396 transitions. [2023-08-31 23:27:34,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37048832271762205 [2023-08-31 23:27:34,892 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1396 transitions. [2023-08-31 23:27:34,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1396 transitions. [2023-08-31 23:27:34,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:34,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1396 transitions. [2023-08-31 23:27:34,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.33333333333333) internal successors, (1396), 12 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:34,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:34,901 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:34,901 INFO L175 Difference]: Start difference. First operand has 61 places, 63 transitions, 446 flow. Second operand 12 states and 1396 transitions. [2023-08-31 23:27:34,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 159 transitions, 1380 flow [2023-08-31 23:27:34,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 159 transitions, 1373 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:27:34,937 INFO L231 Difference]: Finished difference. Result has 76 places, 116 transitions, 1111 flow [2023-08-31 23:27:34,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1111, PETRI_PLACES=76, PETRI_TRANSITIONS=116} [2023-08-31 23:27:34,937 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2023-08-31 23:27:34,937 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 116 transitions, 1111 flow [2023-08-31 23:27:34,938 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:27:34,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:34,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:34,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:27:34,939 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:34,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash -569721640, now seen corresponding path program 2 times [2023-08-31 23:27:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964698078] [2023-08-31 23:27:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:34,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:36,012 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:27:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964698078] [2023-08-31 23:27:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964698078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:36,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:36,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:27:36,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185176284] [2023-08-31 23:27:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:36,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:27:36,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:36,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:27:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:27:36,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 314 [2023-08-31 23:27:36,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 116 transitions, 1111 flow. Second operand has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:36,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:36,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 314 [2023-08-31 23:27:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:37,034 INFO L130 PetriNetUnfolder]: 3464/5456 cut-off events. [2023-08-31 23:27:37,035 INFO L131 PetriNetUnfolder]: For 11283/11317 co-relation queries the response was YES. [2023-08-31 23:27:37,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22481 conditions, 5456 events. 3464/5456 cut-off events. For 11283/11317 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 34473 event pairs, 1749 based on Foata normal form. 17/4978 useless extension candidates. Maximal degree in co-relation 22462. Up to 5078 conditions per place. [2023-08-31 23:27:37,062 INFO L137 encePairwiseOnDemand]: 303/314 looper letters, 136 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2023-08-31 23:27:37,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 165 transitions, 1775 flow [2023-08-31 23:27:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:27:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:27:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 925 transitions. [2023-08-31 23:27:37,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682324840764331 [2023-08-31 23:27:37,066 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 925 transitions. [2023-08-31 23:27:37,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 925 transitions. [2023-08-31 23:27:37,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:37,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 925 transitions. [2023-08-31 23:27:37,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.625) internal successors, (925), 8 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:37,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 314.0) internal successors, (2826), 9 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:37,073 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 314.0) internal successors, (2826), 9 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:37,073 INFO L175 Difference]: Start difference. First operand has 76 places, 116 transitions, 1111 flow. Second operand 8 states and 925 transitions. [2023-08-31 23:27:37,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 165 transitions, 1775 flow [2023-08-31 23:27:37,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 165 transitions, 1747 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-31 23:27:37,115 INFO L231 Difference]: Finished difference. Result has 89 places, 138 transitions, 1452 flow [2023-08-31 23:27:37,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1452, PETRI_PLACES=89, PETRI_TRANSITIONS=138} [2023-08-31 23:27:37,116 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2023-08-31 23:27:37,116 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 138 transitions, 1452 flow [2023-08-31 23:27:37,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:37,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:37,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:37,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:27:37,117 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:37,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1150549318, now seen corresponding path program 3 times [2023-08-31 23:27:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339760776] [2023-08-31 23:27:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:38,177 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:27:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339760776] [2023-08-31 23:27:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339760776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:38,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:27:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357038988] [2023-08-31 23:27:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:38,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:27:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:38,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:27:38,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:27:38,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 314 [2023-08-31 23:27:38,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 138 transitions, 1452 flow. Second operand has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:38,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:38,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 314 [2023-08-31 23:27:38,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:39,634 INFO L130 PetriNetUnfolder]: 3471/5477 cut-off events. [2023-08-31 23:27:39,634 INFO L131 PetriNetUnfolder]: For 12798/12832 co-relation queries the response was YES. [2023-08-31 23:27:39,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23540 conditions, 5477 events. 3471/5477 cut-off events. For 12798/12832 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34637 event pairs, 858 based on Foata normal form. 45/5024 useless extension candidates. Maximal degree in co-relation 23514. Up to 4655 conditions per place. [2023-08-31 23:27:39,663 INFO L137 encePairwiseOnDemand]: 302/314 looper letters, 137 selfloop transitions, 61 changer transitions 1/201 dead transitions. [2023-08-31 23:27:39,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 201 transitions, 2320 flow [2023-08-31 23:27:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:27:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:27:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1272 transitions. [2023-08-31 23:27:39,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682686740011581 [2023-08-31 23:27:39,667 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1272 transitions. [2023-08-31 23:27:39,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1272 transitions. [2023-08-31 23:27:39,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:39,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1272 transitions. [2023-08-31 23:27:39,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.63636363636364) internal successors, (1272), 11 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:39,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:39,676 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:39,676 INFO L175 Difference]: Start difference. First operand has 89 places, 138 transitions, 1452 flow. Second operand 11 states and 1272 transitions. [2023-08-31 23:27:39,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 201 transitions, 2320 flow [2023-08-31 23:27:39,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 201 transitions, 2316 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-31 23:27:39,733 INFO L231 Difference]: Finished difference. Result has 106 places, 167 transitions, 2054 flow [2023-08-31 23:27:39,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2054, PETRI_PLACES=106, PETRI_TRANSITIONS=167} [2023-08-31 23:27:39,734 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2023-08-31 23:27:39,734 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 167 transitions, 2054 flow [2023-08-31 23:27:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:39,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:39,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:39,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:27:39,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:39,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2045510362, now seen corresponding path program 4 times [2023-08-31 23:27:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:39,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326484218] [2023-08-31 23:27:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:40,981 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:27:40,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326484218] [2023-08-31 23:27:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326484218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:40,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:40,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:27:40,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076015918] [2023-08-31 23:27:40,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:40,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:27:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:27:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:27:41,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 314 [2023-08-31 23:27:41,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 167 transitions, 2054 flow. Second operand has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:41,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:41,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 314 [2023-08-31 23:27:41,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:42,377 INFO L130 PetriNetUnfolder]: 3462/5468 cut-off events. [2023-08-31 23:27:42,377 INFO L131 PetriNetUnfolder]: For 18865/18907 co-relation queries the response was YES. [2023-08-31 23:27:42,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25643 conditions, 5468 events. 3462/5468 cut-off events. For 18865/18907 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 34572 event pairs, 869 based on Foata normal form. 38/5178 useless extension candidates. Maximal degree in co-relation 25609. Up to 4695 conditions per place. [2023-08-31 23:27:42,418 INFO L137 encePairwiseOnDemand]: 304/314 looper letters, 123 selfloop transitions, 80 changer transitions 0/205 dead transitions. [2023-08-31 23:27:42,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 205 transitions, 2656 flow [2023-08-31 23:27:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:27:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:27:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1276 transitions. [2023-08-31 23:27:42,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36942675159235666 [2023-08-31 23:27:42,421 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1276 transitions. [2023-08-31 23:27:42,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1276 transitions. [2023-08-31 23:27:42,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:42,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1276 transitions. [2023-08-31 23:27:42,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:42,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:42,430 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 314.0) internal successors, (3768), 12 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:42,430 INFO L175 Difference]: Start difference. First operand has 106 places, 167 transitions, 2054 flow. Second operand 11 states and 1276 transitions. [2023-08-31 23:27:42,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 205 transitions, 2656 flow [2023-08-31 23:27:42,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 205 transitions, 2608 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-31 23:27:42,591 INFO L231 Difference]: Finished difference. Result has 114 places, 171 transitions, 2230 flow [2023-08-31 23:27:42,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2230, PETRI_PLACES=114, PETRI_TRANSITIONS=171} [2023-08-31 23:27:42,592 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 36 predicate places. [2023-08-31 23:27:42,592 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 171 transitions, 2230 flow [2023-08-31 23:27:42,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:42,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:42,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:42,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:27:42,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:42,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1908954123, now seen corresponding path program 1 times [2023-08-31 23:27:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455999178] [2023-08-31 23:27:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:42,894 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:27:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455999178] [2023-08-31 23:27:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455999178] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:42,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:27:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238881137] [2023-08-31 23:27:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:42,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:27:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:27:42,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:27:43,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 314 [2023-08-31 23:27:43,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 171 transitions, 2230 flow. Second operand has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:43,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:43,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 314 [2023-08-31 23:27:43,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:43,802 INFO L130 PetriNetUnfolder]: 2755/4532 cut-off events. [2023-08-31 23:27:43,802 INFO L131 PetriNetUnfolder]: For 16301/16325 co-relation queries the response was YES. [2023-08-31 23:27:43,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20802 conditions, 4532 events. 2755/4532 cut-off events. For 16301/16325 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 29453 event pairs, 921 based on Foata normal form. 98/4470 useless extension candidates. Maximal degree in co-relation 20767. Up to 1947 conditions per place. [2023-08-31 23:27:43,833 INFO L137 encePairwiseOnDemand]: 300/314 looper letters, 148 selfloop transitions, 51 changer transitions 1/202 dead transitions. [2023-08-31 23:27:43,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 202 transitions, 2845 flow [2023-08-31 23:27:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:27:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:27:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-08-31 23:27:43,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853503184713376 [2023-08-31 23:27:43,836 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-08-31 23:27:43,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-08-31 23:27:43,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:43,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-08-31 23:27:43,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:43,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 314.0) internal successors, (2198), 7 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:43,841 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 314.0) internal successors, (2198), 7 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:43,842 INFO L175 Difference]: Start difference. First operand has 114 places, 171 transitions, 2230 flow. Second operand 6 states and 726 transitions. [2023-08-31 23:27:43,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 202 transitions, 2845 flow [2023-08-31 23:27:43,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 202 transitions, 2756 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:27:43,926 INFO L231 Difference]: Finished difference. Result has 117 places, 177 transitions, 2413 flow [2023-08-31 23:27:43,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2413, PETRI_PLACES=117, PETRI_TRANSITIONS=177} [2023-08-31 23:27:43,927 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2023-08-31 23:27:43,928 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 177 transitions, 2413 flow [2023-08-31 23:27:43,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:43,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:43,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:43,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:27:43,929 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:43,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 951964938, now seen corresponding path program 1 times [2023-08-31 23:27:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102291676] [2023-08-31 23:27:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:27:44,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:44,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102291676] [2023-08-31 23:27:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102291676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:27:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949653274] [2023-08-31 23:27:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:44,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:27:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:44,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:27:44,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:27:44,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 314 [2023-08-31 23:27:44,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 177 transitions, 2413 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:27:44,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:44,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 314 [2023-08-31 23:27:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:45,827 INFO L130 PetriNetUnfolder]: 4357/6935 cut-off events. [2023-08-31 23:27:45,827 INFO L131 PetriNetUnfolder]: For 32034/32034 co-relation queries the response was YES. [2023-08-31 23:27:45,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33931 conditions, 6935 events. 4357/6935 cut-off events. For 32034/32034 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 45182 event pairs, 1052 based on Foata normal form. 89/6894 useless extension candidates. Maximal degree in co-relation 33896. Up to 3929 conditions per place. [2023-08-31 23:27:45,881 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 320 selfloop transitions, 43 changer transitions 0/364 dead transitions. [2023-08-31 23:27:45,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 364 transitions, 5333 flow [2023-08-31 23:27:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:27:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:27:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2023-08-31 23:27:45,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38251946213729654 [2023-08-31 23:27:45,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2023-08-31 23:27:45,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2023-08-31 23:27:45,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:45,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2023-08-31 23:27:45,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:45,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 314.0) internal successors, (3140), 10 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:45,892 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 314.0) internal successors, (3140), 10 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:45,892 INFO L175 Difference]: Start difference. First operand has 117 places, 177 transitions, 2413 flow. Second operand 9 states and 1081 transitions. [2023-08-31 23:27:45,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 364 transitions, 5333 flow [2023-08-31 23:27:46,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 364 transitions, 5275 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:27:46,046 INFO L231 Difference]: Finished difference. Result has 125 places, 218 transitions, 3143 flow [2023-08-31 23:27:46,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3143, PETRI_PLACES=125, PETRI_TRANSITIONS=218} [2023-08-31 23:27:46,047 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 47 predicate places. [2023-08-31 23:27:46,047 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 218 transitions, 3143 flow [2023-08-31 23:27:46,047 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:27:46,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:46,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:46,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:27:46,048 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:46,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 950452973, now seen corresponding path program 1 times [2023-08-31 23:27:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331784083] [2023-08-31 23:27:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:46,258 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:27:46,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:46,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331784083] [2023-08-31 23:27:46,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331784083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:46,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:46,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:27:46,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382833095] [2023-08-31 23:27:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:46,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:27:46,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:27:46,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:27:46,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-31 23:27:46,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 218 transitions, 3143 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:46,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:46,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-31 23:27:46,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:46,838 INFO L130 PetriNetUnfolder]: 2119/3722 cut-off events. [2023-08-31 23:27:46,838 INFO L131 PetriNetUnfolder]: For 19767/19776 co-relation queries the response was YES. [2023-08-31 23:27:46,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19376 conditions, 3722 events. 2119/3722 cut-off events. For 19767/19776 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 24152 event pairs, 397 based on Foata normal form. 58/3705 useless extension candidates. Maximal degree in co-relation 19337. Up to 3407 conditions per place. [2023-08-31 23:27:46,865 INFO L137 encePairwiseOnDemand]: 309/314 looper letters, 228 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2023-08-31 23:27:46,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 238 transitions, 3794 flow [2023-08-31 23:27:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:27:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:27:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-31 23:27:46,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43524416135881105 [2023-08-31 23:27:46,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-31 23:27:46,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-31 23:27:46,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:46,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-31 23:27:46,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:46,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:46,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:46,870 INFO L175 Difference]: Start difference. First operand has 125 places, 218 transitions, 3143 flow. Second operand 3 states and 410 transitions. [2023-08-31 23:27:46,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 238 transitions, 3794 flow [2023-08-31 23:27:46,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 238 transitions, 3710 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 23:27:46,957 INFO L231 Difference]: Finished difference. Result has 123 places, 195 transitions, 2744 flow [2023-08-31 23:27:46,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2744, PETRI_PLACES=123, PETRI_TRANSITIONS=195} [2023-08-31 23:27:46,958 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 45 predicate places. [2023-08-31 23:27:46,958 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 195 transitions, 2744 flow [2023-08-31 23:27:46,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:46,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:46,959 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:27:46,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:27:46,959 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:46,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1906043561, now seen corresponding path program 1 times [2023-08-31 23:27:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576999803] [2023-08-31 23:27:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:48,337 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:27:48,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576999803] [2023-08-31 23:27:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576999803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:48,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:27:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147985433] [2023-08-31 23:27:48,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:48,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:27:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:27:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:27:48,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 314 [2023-08-31 23:27:48,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 195 transitions, 2744 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:48,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:48,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 314 [2023-08-31 23:27:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:49,431 INFO L130 PetriNetUnfolder]: 3082/5542 cut-off events. [2023-08-31 23:27:49,431 INFO L131 PetriNetUnfolder]: For 27937/27951 co-relation queries the response was YES. [2023-08-31 23:27:49,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29257 conditions, 5542 events. 3082/5542 cut-off events. For 27937/27951 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 40379 event pairs, 819 based on Foata normal form. 38/5464 useless extension candidates. Maximal degree in co-relation 29217. Up to 3578 conditions per place. [2023-08-31 23:27:49,464 INFO L137 encePairwiseOnDemand]: 306/314 looper letters, 220 selfloop transitions, 51 changer transitions 0/277 dead transitions. [2023-08-31 23:27:49,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 277 transitions, 4178 flow [2023-08-31 23:27:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:27:49,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:27:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-31 23:27:49,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4191082802547771 [2023-08-31 23:27:49,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-31 23:27:49,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-31 23:27:49,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:49,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-31 23:27:49,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:49,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:49,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:49,470 INFO L175 Difference]: Start difference. First operand has 123 places, 195 transitions, 2744 flow. Second operand 5 states and 658 transitions. [2023-08-31 23:27:49,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 277 transitions, 4178 flow [2023-08-31 23:27:49,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 277 transitions, 4168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:27:49,597 INFO L231 Difference]: Finished difference. Result has 128 places, 218 transitions, 3208 flow [2023-08-31 23:27:49,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2740, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3208, PETRI_PLACES=128, PETRI_TRANSITIONS=218} [2023-08-31 23:27:49,598 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 50 predicate places. [2023-08-31 23:27:49,598 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 218 transitions, 3208 flow [2023-08-31 23:27:49,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:49,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:49,599 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:27:49,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:27:49,599 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:49,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1807019973, now seen corresponding path program 2 times [2023-08-31 23:27:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636795606] [2023-08-31 23:27:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:51,120 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:27:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636795606] [2023-08-31 23:27:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636795606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:51,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:51,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:27:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142493182] [2023-08-31 23:27:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:51,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:27:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:27:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:27:51,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 314 [2023-08-31 23:27:51,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 218 transitions, 3208 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:27:51,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:51,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 314 [2023-08-31 23:27:51,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:52,764 INFO L130 PetriNetUnfolder]: 3202/5718 cut-off events. [2023-08-31 23:27:52,764 INFO L131 PetriNetUnfolder]: For 35141/35155 co-relation queries the response was YES. [2023-08-31 23:27:52,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32008 conditions, 5718 events. 3202/5718 cut-off events. For 35141/35155 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 41693 event pairs, 565 based on Foata normal form. 24/5624 useless extension candidates. Maximal degree in co-relation 31966. Up to 4146 conditions per place. [2023-08-31 23:27:52,799 INFO L137 encePairwiseOnDemand]: 304/314 looper letters, 143 selfloop transitions, 165 changer transitions 0/314 dead transitions. [2023-08-31 23:27:52,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 314 transitions, 4839 flow [2023-08-31 23:27:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:27:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:27:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1378 transitions. [2023-08-31 23:27:52,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3657112526539278 [2023-08-31 23:27:52,803 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1378 transitions. [2023-08-31 23:27:52,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1378 transitions. [2023-08-31 23:27:52,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:52,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1378 transitions. [2023-08-31 23:27:52,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.83333333333333) internal successors, (1378), 12 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:52,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:52,811 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 314.0) internal successors, (4082), 13 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:52,811 INFO L175 Difference]: Start difference. First operand has 128 places, 218 transitions, 3208 flow. Second operand 12 states and 1378 transitions. [2023-08-31 23:27:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 314 transitions, 4839 flow [2023-08-31 23:27:53,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 314 transitions, 4834 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:27:53,008 INFO L231 Difference]: Finished difference. Result has 142 places, 260 transitions, 4410 flow [2023-08-31 23:27:53,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=3203, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4410, PETRI_PLACES=142, PETRI_TRANSITIONS=260} [2023-08-31 23:27:53,009 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 64 predicate places. [2023-08-31 23:27:53,009 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 260 transitions, 4410 flow [2023-08-31 23:27:53,009 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:27:53,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:53,009 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:27:53,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:27:53,010 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:53,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1318889429, now seen corresponding path program 3 times [2023-08-31 23:27:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32826151] [2023-08-31 23:27:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:54,917 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:27:54,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32826151] [2023-08-31 23:27:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32826151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:54,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:27:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994419952] [2023-08-31 23:27:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:54,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:27:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:27:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:27:55,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 314 [2023-08-31 23:27:55,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 260 transitions, 4410 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:55,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:55,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 314 [2023-08-31 23:27:55,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:56,495 INFO L130 PetriNetUnfolder]: 3199/5720 cut-off events. [2023-08-31 23:27:56,496 INFO L131 PetriNetUnfolder]: For 44435/44449 co-relation queries the response was YES. [2023-08-31 23:27:56,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34213 conditions, 5720 events. 3199/5720 cut-off events. For 44435/44449 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41974 event pairs, 576 based on Foata normal form. 30/5632 useless extension candidates. Maximal degree in co-relation 34167. Up to 4145 conditions per place. [2023-08-31 23:27:56,537 INFO L137 encePairwiseOnDemand]: 302/314 looper letters, 141 selfloop transitions, 159 changer transitions 4/310 dead transitions. [2023-08-31 23:27:56,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 310 transitions, 5405 flow [2023-08-31 23:27:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 23:27:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 23:27:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1511 transitions. [2023-08-31 23:27:56,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37016168544830963 [2023-08-31 23:27:56,539 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1511 transitions. [2023-08-31 23:27:56,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1511 transitions. [2023-08-31 23:27:56,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:56,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1511 transitions. [2023-08-31 23:27:56,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.23076923076923) internal successors, (1511), 13 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:56,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 314.0) internal successors, (4396), 14 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:56,545 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 314.0) internal successors, (4396), 14 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:56,545 INFO L175 Difference]: Start difference. First operand has 142 places, 260 transitions, 4410 flow. Second operand 13 states and 1511 transitions. [2023-08-31 23:27:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 310 transitions, 5405 flow [2023-08-31 23:27:56,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 310 transitions, 5224 flow, removed 73 selfloop flow, removed 3 redundant places. [2023-08-31 23:27:56,816 INFO L231 Difference]: Finished difference. Result has 154 places, 266 transitions, 4749 flow [2023-08-31 23:27:56,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=4241, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4749, PETRI_PLACES=154, PETRI_TRANSITIONS=266} [2023-08-31 23:27:56,817 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 76 predicate places. [2023-08-31 23:27:56,817 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 266 transitions, 4749 flow [2023-08-31 23:27:56,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:56,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:56,818 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:27:56,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:27:56,818 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:56,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1329602693, now seen corresponding path program 1 times [2023-08-31 23:27:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543827262] [2023-08-31 23:27:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:56,982 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:27:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:56,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543827262] [2023-08-31 23:27:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543827262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:27:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668423772] [2023-08-31 23:27:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:56,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:27:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:27:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:27:56,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-31 23:27:56,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 266 transitions, 4749 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:56,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:56,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-31 23:27:56,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:57,392 INFO L130 PetriNetUnfolder]: 987/2071 cut-off events. [2023-08-31 23:27:57,392 INFO L131 PetriNetUnfolder]: For 17953/17959 co-relation queries the response was YES. [2023-08-31 23:27:57,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12089 conditions, 2071 events. 987/2071 cut-off events. For 17953/17959 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13900 event pairs, 100 based on Foata normal form. 122/2143 useless extension candidates. Maximal degree in co-relation 12040. Up to 1255 conditions per place. [2023-08-31 23:27:57,404 INFO L137 encePairwiseOnDemand]: 309/314 looper letters, 244 selfloop transitions, 7 changer transitions 0/257 dead transitions. [2023-08-31 23:27:57,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 257 transitions, 4646 flow [2023-08-31 23:27:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:27:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:27:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-31 23:27:57,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4323248407643312 [2023-08-31 23:27:57,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-31 23:27:57,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-31 23:27:57,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:57,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-31 23:27:57,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:57,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:57,408 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:57,408 INFO L175 Difference]: Start difference. First operand has 154 places, 266 transitions, 4749 flow. Second operand 4 states and 543 transitions. [2023-08-31 23:27:57,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 257 transitions, 4646 flow [2023-08-31 23:27:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 257 transitions, 4198 flow, removed 62 selfloop flow, removed 17 redundant places. [2023-08-31 23:27:57,447 INFO L231 Difference]: Finished difference. Result has 132 places, 175 transitions, 2528 flow [2023-08-31 23:27:57,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2528, PETRI_PLACES=132, PETRI_TRANSITIONS=175} [2023-08-31 23:27:57,448 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 54 predicate places. [2023-08-31 23:27:57,448 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 175 transitions, 2528 flow [2023-08-31 23:27:57,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:57,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:57,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:57,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:27:57,448 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:57,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash 608524230, now seen corresponding path program 1 times [2023-08-31 23:27:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094272381] [2023-08-31 23:27:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:57,671 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:27:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:57,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094272381] [2023-08-31 23:27:57,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094272381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:57,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:57,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:27:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142471587] [2023-08-31 23:27:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:27:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:27:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:27:57,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-31 23:27:57,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 175 transitions, 2528 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:57,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:57,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-31 23:27:57,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:58,273 INFO L130 PetriNetUnfolder]: 1814/3697 cut-off events. [2023-08-31 23:27:58,273 INFO L131 PetriNetUnfolder]: For 28221/28221 co-relation queries the response was YES. [2023-08-31 23:27:58,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20547 conditions, 3697 events. 1814/3697 cut-off events. For 28221/28221 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 26590 event pairs, 255 based on Foata normal form. 36/3665 useless extension candidates. Maximal degree in co-relation 20509. Up to 1868 conditions per place. [2023-08-31 23:27:58,294 INFO L137 encePairwiseOnDemand]: 311/314 looper letters, 300 selfloop transitions, 2 changer transitions 8/315 dead transitions. [2023-08-31 23:27:58,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 315 transitions, 5117 flow [2023-08-31 23:27:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:27:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:27:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-31 23:27:58,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410828025477707 [2023-08-31 23:27:58,295 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-31 23:27:58,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-31 23:27:58,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:58,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-31 23:27:58,296 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:27:58,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,297 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 314.0) internal successors, (1570), 5 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,297 INFO L175 Difference]: Start difference. First operand has 132 places, 175 transitions, 2528 flow. Second operand 4 states and 554 transitions. [2023-08-31 23:27:58,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 315 transitions, 5117 flow [2023-08-31 23:27:58,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 315 transitions, 5022 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-31 23:27:58,342 INFO L231 Difference]: Finished difference. Result has 134 places, 176 transitions, 2494 flow [2023-08-31 23:27:58,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2494, PETRI_PLACES=134, PETRI_TRANSITIONS=176} [2023-08-31 23:27:58,345 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 56 predicate places. [2023-08-31 23:27:58,345 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 176 transitions, 2494 flow [2023-08-31 23:27:58,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:58,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:58,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:27:58,346 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:58,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2025780722, now seen corresponding path program 2 times [2023-08-31 23:27:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:58,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018594050] [2023-08-31 23:27:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:27:58,577 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:27:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:27:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018594050] [2023-08-31 23:27:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018594050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:27:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:27:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:27:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385387532] [2023-08-31 23:27:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:27:58,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:27:58,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:27:58,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:27:58,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:27:58,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 314 [2023-08-31 23:27:58,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 176 transitions, 2494 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:27:58,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 314 [2023-08-31 23:27:58,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:27:58,887 INFO L130 PetriNetUnfolder]: 820/1673 cut-off events. [2023-08-31 23:27:58,887 INFO L131 PetriNetUnfolder]: For 13695/13701 co-relation queries the response was YES. [2023-08-31 23:27:58,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8942 conditions, 1673 events. 820/1673 cut-off events. For 13695/13701 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 11441 event pairs, 70 based on Foata normal form. 87/1728 useless extension candidates. Maximal degree in co-relation 8903. Up to 749 conditions per place. [2023-08-31 23:27:58,896 INFO L137 encePairwiseOnDemand]: 309/314 looper letters, 159 selfloop transitions, 10 changer transitions 4/177 dead transitions. [2023-08-31 23:27:58,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 177 transitions, 2778 flow [2023-08-31 23:27:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:27:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:27:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-31 23:27:58,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42038216560509556 [2023-08-31 23:27:58,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-31 23:27:58,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-31 23:27:58,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:27:58,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-31 23:27:58,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,899 INFO L175 Difference]: Start difference. First operand has 134 places, 176 transitions, 2494 flow. Second operand 5 states and 660 transitions. [2023-08-31 23:27:58,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 177 transitions, 2778 flow [2023-08-31 23:27:58,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 177 transitions, 2523 flow, removed 22 selfloop flow, removed 16 redundant places. [2023-08-31 23:27:58,912 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 1107 flow [2023-08-31 23:27:58,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=314, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1107, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2023-08-31 23:27:58,913 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2023-08-31 23:27:58,913 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 1107 flow [2023-08-31 23:27:58,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:27:58,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:27:58,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:58,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-31 23:27:58,914 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:27:58,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:27:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1952802652, now seen corresponding path program 1 times [2023-08-31 23:27:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:27:58,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484728607] [2023-08-31 23:27:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:27:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:27:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:27:58,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:27:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:27:59,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:27:59,038 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:27:59,038 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-08-31 23:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-08-31 23:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-08-31 23:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-08-31 23:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-08-31 23:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-08-31 23:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-08-31 23:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-08-31 23:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-08-31 23:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-08-31 23:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-08-31 23:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-08-31 23:27:59,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-08-31 23:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-08-31 23:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-08-31 23:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-08-31 23:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-08-31 23:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-08-31 23:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-08-31 23:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-08-31 23:27:59,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-08-31 23:27:59,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-08-31 23:27:59,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-08-31 23:27:59,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-08-31 23:27:59,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-08-31 23:27:59,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-08-31 23:27:59,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-08-31 23:27:59,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-08-31 23:27:59,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-08-31 23:27:59,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-08-31 23:27:59,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-08-31 23:27:59,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-08-31 23:27:59,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-08-31 23:27:59,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-08-31 23:27:59,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-08-31 23:27:59,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-08-31 23:27:59,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-08-31 23:27:59,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-08-31 23:27:59,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-08-31 23:27:59,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-08-31 23:27:59,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-08-31 23:27:59,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-08-31 23:27:59,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-08-31 23:27:59,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-08-31 23:27:59,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-08-31 23:27:59,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-08-31 23:27:59,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-08-31 23:27:59,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-31 23:27:59,052 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:27:59,058 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:27:59,058 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:27:59,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:27:59 BasicIcfg [2023-08-31 23:27:59,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:27:59,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:27:59,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:27:59,138 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:27:59,139 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:13" (3/4) ... [2023-08-31 23:27:59,141 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:27:59,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:27:59,142 INFO L158 Benchmark]: Toolchain (without parser) took 47786.18ms. Allocated memory was 69.2MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 45.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 378.7MB. Max. memory is 16.1GB. [2023-08-31 23:27:59,142 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:27:59,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.67ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 37.7MB in the end (delta: 7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:27:59,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.95ms. Allocated memory is still 69.2MB. Free memory was 37.7MB in the beginning and 35.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:27:59,142 INFO L158 Benchmark]: Boogie Preprocessor took 53.52ms. Allocated memory is still 69.2MB. Free memory was 35.2MB in the beginning and 33.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:27:59,143 INFO L158 Benchmark]: RCFGBuilder took 1244.52ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.0MB in the beginning and 38.7MB in the end (delta: -5.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-08-31 23:27:59,143 INFO L158 Benchmark]: TraceAbstraction took 45729.67ms. Allocated memory was 83.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 37.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 353.8MB. Max. memory is 16.1GB. [2023-08-31 23:27:59,143 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 2.6GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:27:59,148 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.26ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.67ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 37.7MB in the end (delta: 7.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.95ms. Allocated memory is still 69.2MB. Free memory was 37.7MB in the beginning and 35.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.52ms. Allocated memory is still 69.2MB. Free memory was 35.2MB in the beginning and 33.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1244.52ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.0MB in the beginning and 38.7MB in the end (delta: -5.7MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45729.67ms. Allocated memory was 83.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 37.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 353.8MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 2.6GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 176 PlacesBefore, 78 PlacesAfterwards, 168 TransitionsBefore, 68 TransitionsAfterwards, 6286 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 30012 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10957, independent: 10398, independent conditional: 0, independent unconditional: 10398, dependent: 559, dependent conditional: 0, dependent unconditional: 559, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2606, independent: 2526, independent conditional: 0, independent unconditional: 2526, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10957, independent: 7872, independent conditional: 0, independent unconditional: 7872, dependent: 479, dependent conditional: 0, dependent unconditional: 479, unknown: 2606, unknown conditional: 0, unknown unconditional: 2606] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 361, Positive conditional cache size: 0, Positive unconditional cache size: 361, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=-2, t1749={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 \read(x) [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=-1, t1749={7:0}, t1750={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L853] 0 pthread_t t1751; [L796] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] FCALL, FORK 0 pthread_create(&t1751, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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(&t1751, ((void *)0), P2, ((void *)0))=0, t1749={7:0}, t1750={5:0}, t1751={6:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L824] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={7:0}, t1750={5:0}, t1751={6:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 225 locations, 77 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: 45.5s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3011 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2364 mSDsluCounter, 1187 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6770 IncrementalHoareTripleChecker+Invalid, 7336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 133 mSDtfsCounter, 6770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4749occurred in iteration=20, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 4510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:27:59,175 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/rfi009_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --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:28:01,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:28:01,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:28:01,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:28:01,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:28:01,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:28:01,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:28:01,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:28:01,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:28:01,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:28:01,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:28:01,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:28:01,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:28:01,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:28:01,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:28:01,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:28:01,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:28:01,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:28:01,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:28:01,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:28:01,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:28:01,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:28:01,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:28:01,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:28:01,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:28:01,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:28:01,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:28:01,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:28:01,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:28:01,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:28:01,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:28:01,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:28:01,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:28:01,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:28:01,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:28:01,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:28:01,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:28:01,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:28:01,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:28:01,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:28:01,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:28:01,419 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:28:01,451 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:28:01,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:28:01,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:28:01,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:28:01,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:28:01,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:28:01,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:28:01,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:28:01,455 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:28:01,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:28:01,456 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:28:01,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:28:01,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:28:01,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:28:01,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:28:01,457 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:28:01,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:28:01,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:28:01,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:28:01,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:28:01,457 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:28:01,458 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:28:01,458 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:28:01,458 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:28:01,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:28:01,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:28:01,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:28:01,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:28:01,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:28:01,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:28:01,459 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:28:01,459 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:28:01,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:28:01,460 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:28:01,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:28:01,460 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:28:01,460 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:28:01,461 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 -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 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:28:01,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:28:01,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:28:01,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:28:01,798 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:28:01,798 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:28:01,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-31 23:28:03,133 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:28:03,407 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:28:03,408 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_rmo.oepc.i [2023-08-31 23:28:03,421 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d996cc3/d9f053e76d0840a1aaa9f2017e54bd95/FLAGd1f61f616 [2023-08-31 23:28:03,435 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d996cc3/d9f053e76d0840a1aaa9f2017e54bd95 [2023-08-31 23:28:03,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:28:03,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:28:03,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:28:03,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:28:03,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:28:03,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8a5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03, skipping insertion in model container [2023-08-31 23:28:03,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:28:03,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:28:03,634 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/rfi009_rmo.oepc.i[992,1005] [2023-08-31 23:28:03,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:28:03,794 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:28:03,805 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/rfi009_rmo.oepc.i[992,1005] [2023-08-31 23:28:03,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:28:03,873 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:28:03,873 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:28:03,879 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:28:03,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03 WrapperNode [2023-08-31 23:28:03,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:28:03,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:28:03,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:28:03,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:28:03,886 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:28:03" (1/1) ... [2023-08-31 23:28:03,903 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:28:03" (1/1) ... [2023-08-31 23:28:03,922 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2023-08-31 23:28:03,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:28:03,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:28:03,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:28:03,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:28:03,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:28:03,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:28:03,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:28:03,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:28:03,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (1/1) ... [2023-08-31 23:28:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:28:03,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:28:04,006 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:28:04,031 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:28:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:28:04,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:28:04,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:28:04,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:28:04,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:28:04,049 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:28:04,287 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:28:04,290 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:28:04,820 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:28:05,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:28:05,201 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:28:05,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:28:05 BoogieIcfgContainer [2023-08-31 23:28:05,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:28:05,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:28:05,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:28:05,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:28:05,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:28:03" (1/3) ... [2023-08-31 23:28:05,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30aee1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:28:05, skipping insertion in model container [2023-08-31 23:28:05,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:03" (2/3) ... [2023-08-31 23:28:05,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30aee1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:28:05, skipping insertion in model container [2023-08-31 23:28:05,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:28:05" (3/3) ... [2023-08-31 23:28:05,210 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-08-31 23:28:05,226 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:28:05,227 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-31 23:28:05,227 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:28:05,383 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:28:05,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 172 transitions, 359 flow [2023-08-31 23:28:05,470 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-31 23:28:05,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:05,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 240 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-31 23:28:05,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 172 transitions, 359 flow [2023-08-31 23:28:05,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 169 transitions, 347 flow [2023-08-31 23:28:05,486 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:28:05,494 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-31 23:28:05,497 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 347 flow [2023-08-31 23:28:05,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 347 flow [2023-08-31 23:28:05,542 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-08-31 23:28:05,542 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:05,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 2/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 244 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-31 23:28:05,547 INFO L119 LiptonReduction]: Number of co-enabled transitions 6286 [2023-08-31 23:28:16,901 INFO L134 LiptonReduction]: Checked pairs total: 30266 [2023-08-31 23:28:16,902 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-31 23:28:16,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:28:16,920 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;@718df6b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:28:16,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-08-31 23:28:16,922 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:28:16,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:16,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:16,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:28:16,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:16,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2023-08-31 23:28:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162273475] [2023-08-31 23:28:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:16,939 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:28:16,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:16,945 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:28:16,991 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:28:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:17,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:28:17,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:17,071 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,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:17,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162273475] [2023-08-31 23:28:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162273475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:17,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:28:17,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404668220] [2023-08-31 23:28:17,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:28:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:17,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:28:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:28:17,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 318 [2023-08-31 23:28:17,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 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:17,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:17,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 318 [2023-08-31 23:28:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:19,368 INFO L130 PetriNetUnfolder]: 11260/15878 cut-off events. [2023-08-31 23:28:19,369 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:28:19,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 15878 events. 11260/15878 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 99609 event pairs, 11260 based on Foata normal form. 0/7400 useless extension candidates. Maximal degree in co-relation 31810. Up to 15867 conditions per place. [2023-08-31 23:28:19,484 INFO L137 encePairwiseOnDemand]: 292/318 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-31 23:28:19,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2023-08-31 23:28:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:28:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:28:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 320 transitions. [2023-08-31 23:28:19,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031446540880503 [2023-08-31 23:28:19,510 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 320 transitions. [2023-08-31 23:28:19,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 320 transitions. [2023-08-31 23:28:19,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:19,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 320 transitions. [2023-08-31 23:28:19,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.0) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call 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,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:19,527 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:19,529 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 2 states and 320 transitions. [2023-08-31 23:28:19,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2023-08-31 23:28:19,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:19,539 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-31 23:28:19,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-31 23:28:19,544 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -28 predicate places. [2023-08-31 23:28:19,544 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-31 23:28:19,545 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:19,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:19,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:28:19,556 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:28:19,756 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:28:19,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:19,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 964457, now seen corresponding path program 1 times [2023-08-31 23:28:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300774490] [2023-08-31 23:28:19,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:19,759 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:28:19,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:19,760 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:28:19,763 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:28:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:19,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:28:19,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:19,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:28:19,991 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:28:20,043 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:20,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:20,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300774490] [2023-08-31 23:28:20,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300774490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:20,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:20,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126839236] [2023-08-31 23:28:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:20,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:20,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:20,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 318 [2023-08-31 23:28:20,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 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:28:20,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:20,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 318 [2023-08-31 23:28:20,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:20,998 INFO L130 PetriNetUnfolder]: 4344/6247 cut-off events. [2023-08-31 23:28:20,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:21,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 6247 events. 4344/6247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 34883 event pairs, 4344 based on Foata normal form. 0/3773 useless extension candidates. Maximal degree in co-relation 12534. Up to 6237 conditions per place. [2023-08-31 23:28:21,039 INFO L137 encePairwiseOnDemand]: 310/318 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-31 23:28:21,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2023-08-31 23:28:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-31 23:28:21,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4381551362683438 [2023-08-31 23:28:21,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-31 23:28:21,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-31 23:28:21,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:21,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-31 23:28:21,046 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:21,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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,052 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 418 transitions. [2023-08-31 23:28:21,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2023-08-31 23:28:21,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:28:21,054 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-31 23:28:21,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-31 23:28:21,055 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-31 23:28:21,056 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-31 23:28:21,056 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:28:21,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:21,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:28:21,072 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:28:21,266 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:28:21,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 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 964456, now seen corresponding path program 1 times [2023-08-31 23:28:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:21,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375321838] [2023-08-31 23:28:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:21,268 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:28:21,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:21,269 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:28:21,272 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:28:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:21,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:28:21,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:21,412 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 23:28:21,413 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:28:21,445 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,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:21,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375321838] [2023-08-31 23:28:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375321838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998586822] [2023-08-31 23:28:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:21,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:21,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-31 23:28:21,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 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:28:21,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:21,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-31 23:28:21,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:21,998 INFO L130 PetriNetUnfolder]: 1994/2944 cut-off events. [2023-08-31 23:28:21,999 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 2944 events. 1994/2944 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14854 event pairs, 1138 based on Foata normal form. 0/2164 useless extension candidates. Maximal degree in co-relation 5913. Up to 1817 conditions per place. [2023-08-31 23:28:22,013 INFO L137 encePairwiseOnDemand]: 309/318 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-31 23:28:22,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 168 flow [2023-08-31 23:28:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:28:22,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350104821802935 [2023-08-31 23:28:22,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:28:22,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:28:22,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:22,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:28:22,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:22,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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,020 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:28:22,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 168 flow [2023-08-31 23:28:22,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:22,022 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 89 flow [2023-08-31 23:28:22,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-31 23:28:22,023 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-31 23:28:22,023 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 89 flow [2023-08-31 23:28:22,024 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:28:22,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:22,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:22,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-31 23:28:22,232 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:28:22,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:22,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash -860426358, now seen corresponding path program 1 times [2023-08-31 23:28:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296832250] [2023-08-31 23:28:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:22,234 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:28:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:22,235 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:28:22,238 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:28:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:22,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:28:22,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:22,368 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:22,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:22,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296832250] [2023-08-31 23:28:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296832250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:28:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315861543] [2023-08-31 23:28:22,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:22,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:22,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-31 23:28:22,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call 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,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:22,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-31 23:28:22,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:22,668 INFO L130 PetriNetUnfolder]: 860/1412 cut-off events. [2023-08-31 23:28:22,668 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2023-08-31 23:28:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1412 events. 860/1412 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7060 event pairs, 303 based on Foata normal form. 18/1237 useless extension candidates. Maximal degree in co-relation 3092. Up to 1324 conditions per place. [2023-08-31 23:28:22,681 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-31 23:28:22,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 211 flow [2023-08-31 23:28:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-31 23:28:22,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350104821802935 [2023-08-31 23:28:22,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-31 23:28:22,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-31 23:28:22,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:22,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-31 23:28:22,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:22,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call 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,688 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 89 flow. Second operand 3 states and 415 transitions. [2023-08-31 23:28:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 211 flow [2023-08-31 23:28:22,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:22,692 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-31 23:28:22,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-31 23:28:22,694 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2023-08-31 23:28:22,694 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-31 23:28:22,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call 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,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:22,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:22,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:28:22,904 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:28:22,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:22,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1783455059, now seen corresponding path program 1 times [2023-08-31 23:28:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071385670] [2023-08-31 23:28:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:22,905 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:28:22,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:22,906 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:28:22,907 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:28:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:23,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:28:23,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:23,063 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,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:23,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071385670] [2023-08-31 23:28:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071385670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515147888] [2023-08-31 23:28:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:23,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-31 23:28:23,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:23,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:23,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-31 23:28:23,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:23,332 INFO L130 PetriNetUnfolder]: 209/419 cut-off events. [2023-08-31 23:28:23,332 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-31 23:28:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 419 events. 209/419 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1673 event pairs, 65 based on Foata normal form. 21/392 useless extension candidates. Maximal degree in co-relation 1037. Up to 239 conditions per place. [2023-08-31 23:28:23,334 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-08-31 23:28:23,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 279 flow [2023-08-31 23:28:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-31 23:28:23,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43160377358490565 [2023-08-31 23:28:23,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-31 23:28:23,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-31 23:28:23,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:23,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-31 23:28:23,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:23,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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,342 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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,342 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 549 transitions. [2023-08-31 23:28:23,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 279 flow [2023-08-31 23:28:23,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:23,344 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 147 flow [2023-08-31 23:28:23,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-31 23:28:23,345 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2023-08-31 23:28:23,345 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 147 flow [2023-08-31 23:28:23,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:23,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:23,346 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:28:23,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:28:23,557 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:28:23,558 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:23,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash -131224782, now seen corresponding path program 1 times [2023-08-31 23:28:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148967277] [2023-08-31 23:28:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:23,560 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:28:23,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:23,561 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:28:23,564 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:28:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:23,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:28:23,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:23,735 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,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:23,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148967277] [2023-08-31 23:28:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148967277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:23,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:28:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961420168] [2023-08-31 23:28:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:23,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:23,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-31 23:28:23,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 147 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:28:23,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:23,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-31 23:28:23,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:24,053 INFO L130 PetriNetUnfolder]: 114/224 cut-off events. [2023-08-31 23:28:24,053 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-31 23:28:24,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 224 events. 114/224 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 743 event pairs, 40 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 630. Up to 92 conditions per place. [2023-08-31 23:28:24,054 INFO L137 encePairwiseOnDemand]: 313/318 looper letters, 40 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2023-08-31 23:28:24,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 273 flow [2023-08-31 23:28:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-31 23:28:24,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41949685534591197 [2023-08-31 23:28:24,057 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-31 23:28:24,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-31 23:28:24,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:24,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-31 23:28:24,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:24,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call 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,063 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call 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,063 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 147 flow. Second operand 5 states and 667 transitions. [2023-08-31 23:28:24,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 273 flow [2023-08-31 23:28:24,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 257 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:24,068 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-31 23:28:24,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-31 23:28:24,070 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2023-08-31 23:28:24,071 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-31 23:28:24,071 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:28:24,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:24,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:24,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:28:24,292 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:28:24,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:24,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash -387785208, now seen corresponding path program 1 times [2023-08-31 23:28:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518803454] [2023-08-31 23:28:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:24,294 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:28:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:24,295 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:28:24,296 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:28:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:24,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 23:28:24,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:25,193 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 7 treesize of output 5 [2023-08-31 23:28:25,197 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 7 treesize of output 5 [2023-08-31 23:28:25,236 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,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:25,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:25,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518803454] [2023-08-31 23:28:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518803454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:25,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:25,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394191413] [2023-08-31 23:28:25,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:25,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:25,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:25,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:25,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 318 [2023-08-31 23:28:25,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call 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,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:25,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 318 [2023-08-31 23:28:25,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:25,495 INFO L130 PetriNetUnfolder]: 114/235 cut-off events. [2023-08-31 23:28:25,495 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2023-08-31 23:28:25,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 235 events. 114/235 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 864 event pairs, 24 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 662. Up to 163 conditions per place. [2023-08-31 23:28:25,496 INFO L137 encePairwiseOnDemand]: 314/318 looper letters, 41 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-31 23:28:25,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 277 flow [2023-08-31 23:28:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2023-08-31 23:28:25,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006289308176101 [2023-08-31 23:28:25,499 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2023-08-31 23:28:25,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2023-08-31 23:28:25,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:25,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2023-08-31 23:28:25,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call 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,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call 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,504 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 318.0) internal successors, (1908), 6 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call 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,504 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 5 states and 637 transitions. [2023-08-31 23:28:25,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 277 flow [2023-08-31 23:28:25,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:25,507 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 115 flow [2023-08-31 23:28:25,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:28:25,508 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -33 predicate places. [2023-08-31 23:28:25,508 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 115 flow [2023-08-31 23:28:25,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call 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,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:25,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:25,523 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:28:25,719 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:28:25,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:25,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1561628593, now seen corresponding path program 1 times [2023-08-31 23:28:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457140237] [2023-08-31 23:28:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:25,721 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:28:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:25,723 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:28:25,725 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:28:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:25,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:28:25,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:26,182 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 7 treesize of output 5 [2023-08-31 23:28:26,265 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:26,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:26,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457140237] [2023-08-31 23:28:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457140237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686462787] [2023-08-31 23:28:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:26,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:26,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:26,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:26,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 318 [2023-08-31 23:28:26,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:26,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 318 [2023-08-31 23:28:26,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:26,564 INFO L130 PetriNetUnfolder]: 114/247 cut-off events. [2023-08-31 23:28:26,564 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-31 23:28:26,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 247 events. 114/247 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 985 event pairs, 17 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 657. Up to 165 conditions per place. [2023-08-31 23:28:26,566 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-31 23:28:26,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 247 flow [2023-08-31 23:28:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-31 23:28:26,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41823899371069184 [2023-08-31 23:28:26,568 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-31 23:28:26,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-31 23:28:26,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:26,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-31 23:28:26,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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,572 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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,572 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 115 flow. Second operand 4 states and 532 transitions. [2023-08-31 23:28:26,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 247 flow [2023-08-31 23:28:26,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:28:26,575 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-08-31 23:28:26,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:28:26,575 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -34 predicate places. [2023-08-31 23:28:26,576 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-08-31 23:28:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:26,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:26,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:26,588 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:28:26,788 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:28:26,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:26,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash -585793652, now seen corresponding path program 1 times [2023-08-31 23:28:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:26,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916636723] [2023-08-31 23:28:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:26,790 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:28:26,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:26,791 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:28:26,794 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:28:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:26,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:28:26,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:26,995 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:26,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:26,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916636723] [2023-08-31 23:28:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916636723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:26,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572877464] [2023-08-31 23:28:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:26,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:27,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 318 [2023-08-31 23:28:27,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 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:27,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:27,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 318 [2023-08-31 23:28:27,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:27,238 INFO L130 PetriNetUnfolder]: 205/413 cut-off events. [2023-08-31 23:28:27,238 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2023-08-31 23:28:27,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 413 events. 205/413 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1752 event pairs, 26 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1120. Up to 205 conditions per place. [2023-08-31 23:28:27,240 INFO L137 encePairwiseOnDemand]: 315/318 looper letters, 60 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-31 23:28:27,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 359 flow [2023-08-31 23:28:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-31 23:28:27,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425314465408805 [2023-08-31 23:28:27,243 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-31 23:28:27,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-31 23:28:27,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:27,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-31 23:28:27,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:27,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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,247 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 318.0) internal successors, (1590), 5 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call 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,247 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 4 states and 541 transitions. [2023-08-31 23:28:27,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 359 flow [2023-08-31 23:28:27,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:27,250 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 122 flow [2023-08-31 23:28:27,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-08-31 23:28:27,251 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2023-08-31 23:28:27,251 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 122 flow [2023-08-31 23:28:27,251 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:27,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:27,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:27,265 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 (10)] Ended with exit code 0 [2023-08-31 23:28:27,461 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:28:27,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:27,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1782544878, now seen corresponding path program 2 times [2023-08-31 23:28:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305475756] [2023-08-31 23:28:27,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:28:27,463 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:28:27,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:27,464 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:28:27,467 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:28:27,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:28:27,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:28:27,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:28:27,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:28:27,744 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:28:27,796 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:28:28,154 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2023-08-31 23:28:28,176 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 7 treesize of output 5 [2023-08-31 23:28:28,193 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 7 treesize of output 5 [2023-08-31 23:28:28,247 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,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:28:28,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:28:28,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305475756] [2023-08-31 23:28:28,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305475756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:28,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:28,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:28:28,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696447119] [2023-08-31 23:28:28,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:28,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:28:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:28:28,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:28:28,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:28:28,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 318 [2023-08-31 23:28:28,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:28,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:28,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 318 [2023-08-31 23:28:28,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:29,050 INFO L130 PetriNetUnfolder]: 238/519 cut-off events. [2023-08-31 23:28:29,050 INFO L131 PetriNetUnfolder]: For 521/521 co-relation queries the response was YES. [2023-08-31 23:28:29,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 519 events. 238/519 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2587 event pairs, 98 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 1575. Up to 280 conditions per place. [2023-08-31 23:28:29,053 INFO L137 encePairwiseOnDemand]: 312/318 looper letters, 66 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-08-31 23:28:29,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 470 flow [2023-08-31 23:28:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:28:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:28:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-08-31 23:28:29,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38784067085953877 [2023-08-31 23:28:29,056 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-08-31 23:28:29,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-08-31 23:28:29,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:29,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-08-31 23:28:29,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call 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,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call 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,061 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 318.0) internal successors, (2226), 7 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call 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,061 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 122 flow. Second operand 6 states and 740 transitions. [2023-08-31 23:28:29,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 470 flow [2023-08-31 23:28:29,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:29,065 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 166 flow [2023-08-31 23:28:29,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-08-31 23:28:29,065 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2023-08-31 23:28:29,066 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 166 flow [2023-08-31 23:28:29,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:29,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:29,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:29,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:28:29,277 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:28:29,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-08-31 23:28:29,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:29,278 INFO L85 PathProgramCache]: Analyzing trace with hash 126121350, now seen corresponding path program 3 times [2023-08-31 23:28:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:28:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255866417] [2023-08-31 23:28:29,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:28:29,278 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:28:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:28:29,279 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:28:29,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:28:29,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:28:29,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:28:29,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:28:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:28:29,649 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:28:29,650 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:28:29,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-08-31 23:28:29,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-08-31 23:28:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-08-31 23:28:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-08-31 23:28:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-08-31 23:28:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-08-31 23:28:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-08-31 23:28:29,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-08-31 23:28:29,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-08-31 23:28:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-08-31 23:28:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-08-31 23:28:29,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-08-31 23:28:29,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-08-31 23:28:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-08-31 23:28:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-08-31 23:28:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-08-31 23:28:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-08-31 23:28:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-08-31 23:28:29,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-08-31 23:28:29,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-08-31 23:28:29,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-08-31 23:28:29,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-08-31 23:28:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-08-31 23:28:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-08-31 23:28:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-08-31 23:28:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-08-31 23:28:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-08-31 23:28:29,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-08-31 23:28:29,675 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:28:29,875 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:28:29,875 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:29,880 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:28:29,880 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:28:29,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:28:29 BasicIcfg [2023-08-31 23:28:29,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:28:29,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:28:29,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:28:29,951 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:28:29,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:28:05" (3/4) ... [2023-08-31 23:28:29,954 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:28:29,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:28:29,954 INFO L158 Benchmark]: Toolchain (without parser) took 26515.54ms. Allocated memory was 62.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 29.9MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2023-08-31 23:28:29,955 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 26.6MB in the beginning and 26.6MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:28:29,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.72ms. Allocated memory is still 62.9MB. Free memory was 29.6MB in the beginning and 34.7MB in the end (delta: -5.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2023-08-31 23:28:29,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.19ms. Allocated memory is still 62.9MB. Free memory was 34.7MB in the beginning and 32.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:28:29,955 INFO L158 Benchmark]: Boogie Preprocessor took 45.21ms. Allocated memory is still 62.9MB. Free memory was 32.2MB in the beginning and 29.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:28:29,956 INFO L158 Benchmark]: RCFGBuilder took 1234.42ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 29.7MB in the beginning and 62.1MB in the end (delta: -32.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-08-31 23:28:29,956 INFO L158 Benchmark]: TraceAbstraction took 24745.44ms. Allocated memory was 92.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 61.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. [2023-08-31 23:28:29,956 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 2.1GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:28:29,958 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 48.2MB. Free memory was 26.6MB in the beginning and 26.6MB in the end (delta: 37.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.72ms. Allocated memory is still 62.9MB. Free memory was 29.6MB in the beginning and 34.7MB in the end (delta: -5.2MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.19ms. Allocated memory is still 62.9MB. Free memory was 34.7MB in the beginning and 32.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.21ms. Allocated memory is still 62.9MB. Free memory was 32.2MB in the beginning and 29.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1234.42ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 29.7MB in the beginning and 62.1MB in the end (delta: -32.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24745.44ms. Allocated memory was 92.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 61.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 2.1GB. Free memory is still 1.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: 11.4s, 177 PlacesBefore, 78 PlacesAfterwards, 169 TransitionsBefore, 68 TransitionsAfterwards, 6286 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 146 TotalNumberOfCompositions, 30266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11437, independent: 10874, independent conditional: 0, independent unconditional: 10874, dependent: 563, dependent conditional: 0, dependent unconditional: 563, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2631, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11437, independent: 8320, independent conditional: 0, independent unconditional: 8320, dependent: 486, dependent conditional: 0, dependent unconditional: 486, unknown: 2631, unknown conditional: 0, unknown unconditional: 2631] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 393, Positive conditional cache size: 0, Positive unconditional cache size: 393, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1749, ((void *)0), P0, ((void *)0))=0, t1749={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t1750; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 \read(x) [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L781] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L852] FCALL, FORK 0 pthread_create(&t1750, ((void *)0), P1, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1750, ((void *)0), P1, ((void *)0))=1, t1749={15:0}, t1750={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t1751; [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L796] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 \read(x) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 2 x$flush_delayed = (_Bool)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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] FCALL, FORK 0 pthread_create(&t1751, ((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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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(&t1751, ((void *)0), P2, ((void *)0))=2, t1749={15:0}, t1750={5:0}, t1751={7:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L817] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 2 return 0; [L824] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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, t1749={15:0}, t1750={5:0}, t1751={7:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 226 locations, 77 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 680 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 91 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 783 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:28:29,985 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