./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.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 d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:37:52,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:37:52,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:37:52,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:37:52,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:37:52,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:37:52,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:37:52,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:37:52,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:37:52,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:37:52,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:37:52,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:37:52,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:37:52,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:37:52,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:37:52,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:37:52,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:37:52,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:37:52,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:37:52,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:37:52,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:37:52,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:37:52,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:37:52,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:37:52,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:37:52,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:37:52,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:37:52,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:37:52,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:37:52,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:37:52,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:37:52,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:37:52,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:37:52,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:37:52,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:37:52,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:37:52,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:37:52,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:37:52,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:37:52,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:37:52,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:37:52,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:37:52,537 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:37:52,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:37:52,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:37:52,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:37:52,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:37:52,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:37:52,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:37:52,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:37:52,540 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:37:52,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:37:52,540 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:37:52,541 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:37:52,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:37:52,542 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:37:52,542 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:37:52,542 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:37:52,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:37:52,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:37:52,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:37:52,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:37:52,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:37:52,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:37:52,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:37:52,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:37:52,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:37:52,543 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:37:52,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:37:52,544 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:37:52,544 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 -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 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 -> AFTER [2023-08-29 20:37:52,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:37:52,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:37:52,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:37:52,846 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:37:52,846 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:37:52,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2023-08-29 20:37:53,931 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:37:54,142 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:37:54,142 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2023-08-29 20:37:54,154 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece58aafa/11046c1bf58a4f71b1bf8be8bff4a70a/FLAGfc358c1ba [2023-08-29 20:37:54,505 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece58aafa/11046c1bf58a4f71b1bf8be8bff4a70a [2023-08-29 20:37:54,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:37:54,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:37:54,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:37:54,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:37:54,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:37:54,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a129e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54, skipping insertion in model container [2023-08-29 20:37:54,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:37:54,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:37:54,680 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/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-29 20:37:54,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:37:54,787 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:37:54,797 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/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-29 20:37:54,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:37:54,850 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:37:54,851 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:37:54,855 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:37:54,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54 WrapperNode [2023-08-29 20:37:54,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:37:54,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:37:54,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:37:54,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:37:54,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,913 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2023-08-29 20:37:54,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:37:54,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:37:54,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:37:54,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:37:54,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,947 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:37:54,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:37:54,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:37:54,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:37:54,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (1/1) ... [2023-08-29 20:37:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:37:54,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:37:54,993 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-29 20:37:55,014 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-29 20:37:55,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:37:55,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:37:55,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:37:55,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:37:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:37:55,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:37:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:37:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:37:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:37:55,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:37:55,029 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:37:55,168 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:37:55,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:37:55,457 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:37:55,662 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:37:55,662 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:37:55,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:37:55 BoogieIcfgContainer [2023-08-29 20:37:55,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:37:55,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:37:55,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:37:55,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:37:55,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:37:54" (1/3) ... [2023-08-29 20:37:55,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffec59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:37:55, skipping insertion in model container [2023-08-29 20:37:55,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:37:54" (2/3) ... [2023-08-29 20:37:55,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffec59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:37:55, skipping insertion in model container [2023-08-29 20:37:55,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:37:55" (3/3) ... [2023-08-29 20:37:55,669 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2023-08-29 20:37:55,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:37:55,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-29 20:37:55,682 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:37:55,763 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:37:55,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 159 transitions, 333 flow [2023-08-29 20:37:55,845 INFO L130 PetriNetUnfolder]: 2/156 cut-off events. [2023-08-29 20:37:55,863 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:37:55,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 156 events. 2/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:37:55,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 159 transitions, 333 flow [2023-08-29 20:37:55,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 156 transitions, 321 flow [2023-08-29 20:37:55,881 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:37:55,887 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 156 transitions, 321 flow [2023-08-29 20:37:55,889 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 156 transitions, 321 flow [2023-08-29 20:37:55,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 156 transitions, 321 flow [2023-08-29 20:37:55,910 INFO L130 PetriNetUnfolder]: 2/156 cut-off events. [2023-08-29 20:37:55,914 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:37:55,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 156 events. 2/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:37:55,917 INFO L119 LiptonReduction]: Number of co-enabled transitions 4408 [2023-08-29 20:38:02,034 INFO L134 LiptonReduction]: Checked pairs total: 18659 [2023-08-29 20:38:02,034 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-29 20:38:02,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:38:02,054 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;@62ea646d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:38:02,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-08-29 20:38:02,055 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:38:02,055 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:02,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:02,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:38:02,057 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:02,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash 803, now seen corresponding path program 1 times [2023-08-29 20:38:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:02,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605597670] [2023-08-29 20:38:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:02,158 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-29 20:38:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605597670] [2023-08-29 20:38:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605597670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:38:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940313303] [2023-08-29 20:38:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:02,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:38:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:38:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:38:02,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-29 20:38:02,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 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-29 20:38:02,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:02,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-29 20:38:02,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:03,028 INFO L130 PetriNetUnfolder]: 5006/7261 cut-off events. [2023-08-29 20:38:03,029 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 20:38:03,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14515 conditions, 7261 events. 5006/7261 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 45104 event pairs, 5006 based on Foata normal form. 135/4063 useless extension candidates. Maximal degree in co-relation 14504. Up to 7208 conditions per place. [2023-08-29 20:38:03,062 INFO L137 encePairwiseOnDemand]: 277/294 looper letters, 35 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2023-08-29 20:38:03,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 161 flow [2023-08-29 20:38:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:38:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:38:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-08-29 20:38:03,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2023-08-29 20:38:03,075 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-08-29 20:38:03,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-08-29 20:38:03,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:03,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-08-29 20:38:03,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,084 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,086 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 2 states and 306 transitions. [2023-08-29 20:38:03,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 161 flow [2023-08-29 20:38:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:03,090 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 88 flow [2023-08-29 20:38:03,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-29 20:38:03,093 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 20:38:03,093 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 88 flow [2023-08-29 20:38:03,094 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-29 20:38:03,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:03,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:38:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:38:03,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:03,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash 790125, now seen corresponding path program 1 times [2023-08-29 20:38:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792085931] [2023-08-29 20:38:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:03,272 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-29 20:38:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792085931] [2023-08-29 20:38:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792085931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473901801] [2023-08-29 20:38:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:03,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 294 [2023-08-29 20:38:03,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:03,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 294 [2023-08-29 20:38:03,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:03,915 INFO L130 PetriNetUnfolder]: 4393/6582 cut-off events. [2023-08-29 20:38:03,915 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:03,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13109 conditions, 6582 events. 4393/6582 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 39821 event pairs, 2912 based on Foata normal form. 0/4288 useless extension candidates. Maximal degree in co-relation 13106. Up to 4250 conditions per place. [2023-08-29 20:38:03,935 INFO L137 encePairwiseOnDemand]: 280/294 looper letters, 42 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2023-08-29 20:38:03,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 214 flow [2023-08-29 20:38:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-29 20:38:03,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47505668934240364 [2023-08-29 20:38:03,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-29 20:38:03,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-29 20:38:03,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:03,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-29 20:38:03,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,943 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 88 flow. Second operand 3 states and 419 transitions. [2023-08-29 20:38:03,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 214 flow [2023-08-29 20:38:03,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:38:03,945 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 148 flow [2023-08-29 20:38:03,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-29 20:38:03,946 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-08-29 20:38:03,946 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 148 flow [2023-08-29 20:38:03,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:03,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:03,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:38:03,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:38:03,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:03,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 790126, now seen corresponding path program 1 times [2023-08-29 20:38:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:03,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225741968] [2023-08-29 20:38:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:04,072 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-29 20:38:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:04,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225741968] [2023-08-29 20:38:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225741968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:04,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:04,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:04,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467371095] [2023-08-29 20:38:04,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:04,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:04,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:04,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 294 [2023-08-29 20:38:04,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:04,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 294 [2023-08-29 20:38:04,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:04,385 INFO L130 PetriNetUnfolder]: 1845/2936 cut-off events. [2023-08-29 20:38:04,385 INFO L131 PetriNetUnfolder]: For 697/751 co-relation queries the response was YES. [2023-08-29 20:38:04,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7466 conditions, 2936 events. 1845/2936 cut-off events. For 697/751 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17211 event pairs, 1551 based on Foata normal form. 419/2934 useless extension candidates. Maximal degree in co-relation 7461. Up to 2740 conditions per place. [2023-08-29 20:38:04,398 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2023-08-29 20:38:04,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 200 flow [2023-08-29 20:38:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-29 20:38:04,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2023-08-29 20:38:04,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-29 20:38:04,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-29 20:38:04,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:04,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-29 20:38:04,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,403 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 148 flow. Second operand 3 states and 408 transitions. [2023-08-29 20:38:04,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 200 flow [2023-08-29 20:38:04,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:04,408 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 120 flow [2023-08-29 20:38:04,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-29 20:38:04,409 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 20:38:04,409 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 120 flow [2023-08-29 20:38:04,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:04,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:04,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:38:04,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:04,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1335570952, now seen corresponding path program 1 times [2023-08-29 20:38:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:04,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965874078] [2023-08-29 20:38:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:04,531 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-29 20:38:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965874078] [2023-08-29 20:38:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965874078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:04,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:04,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171560155] [2023-08-29 20:38:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:04,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:04,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 294 [2023-08-29 20:38:04,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:04,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 294 [2023-08-29 20:38:04,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:04,845 INFO L130 PetriNetUnfolder]: 1690/2723 cut-off events. [2023-08-29 20:38:04,845 INFO L131 PetriNetUnfolder]: For 286/325 co-relation queries the response was YES. [2023-08-29 20:38:04,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6525 conditions, 2723 events. 1690/2723 cut-off events. For 286/325 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 15990 event pairs, 1101 based on Foata normal form. 0/2186 useless extension candidates. Maximal degree in co-relation 6520. Up to 1744 conditions per place. [2023-08-29 20:38:04,859 INFO L137 encePairwiseOnDemand]: 290/294 looper letters, 51 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-29 20:38:04,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 300 flow [2023-08-29 20:38:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:38:04,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481859410430839 [2023-08-29 20:38:04,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:38:04,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:38:04,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:04,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:38:04,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,865 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 120 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:38:04,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 300 flow [2023-08-29 20:38:04,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:04,866 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2023-08-29 20:38:04,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-29 20:38:04,867 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 20:38:04,867 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2023-08-29 20:38:04,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:04,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:04,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:04,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:38:04,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:04,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1335570651, now seen corresponding path program 1 times [2023-08-29 20:38:04,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:04,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066853899] [2023-08-29 20:38:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:05,030 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-29 20:38:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:05,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066853899] [2023-08-29 20:38:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066853899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85086680] [2023-08-29 20:38:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:05,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:05,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 294 [2023-08-29 20:38:05,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:05,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 294 [2023-08-29 20:38:05,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:05,285 INFO L130 PetriNetUnfolder]: 1588/2601 cut-off events. [2023-08-29 20:38:05,285 INFO L131 PetriNetUnfolder]: For 652/661 co-relation queries the response was YES. [2023-08-29 20:38:05,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6736 conditions, 2601 events. 1588/2601 cut-off events. For 652/661 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 15621 event pairs, 340 based on Foata normal form. 0/2237 useless extension candidates. Maximal degree in co-relation 6730. Up to 2053 conditions per place. [2023-08-29 20:38:05,293 INFO L137 encePairwiseOnDemand]: 291/294 looper letters, 47 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-29 20:38:05,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 296 flow [2023-08-29 20:38:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:38:05,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47165532879818595 [2023-08-29 20:38:05,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:38:05,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:38:05,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:05,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:38:05,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,298 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:38:05,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 296 flow [2023-08-29 20:38:05,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:05,300 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 134 flow [2023-08-29 20:38:05,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-29 20:38:05,300 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 20:38:05,301 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 134 flow [2023-08-29 20:38:05,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:05,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:05,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:38:05,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:05,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1493167655, now seen corresponding path program 1 times [2023-08-29 20:38:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586487041] [2023-08-29 20:38:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:05,449 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-29 20:38:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:05,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586487041] [2023-08-29 20:38:05,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586487041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399662759] [2023-08-29 20:38:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:38:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:38:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:38:05,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 294 [2023-08-29 20:38:05,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:05,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 294 [2023-08-29 20:38:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:05,842 INFO L130 PetriNetUnfolder]: 1695/2689 cut-off events. [2023-08-29 20:38:05,842 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2023-08-29 20:38:05,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 2689 events. 1695/2689 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 15366 event pairs, 911 based on Foata normal form. 0/2332 useless extension candidates. Maximal degree in co-relation 7043. Up to 1097 conditions per place. [2023-08-29 20:38:05,852 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 53 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2023-08-29 20:38:05,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 352 flow [2023-08-29 20:38:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-29 20:38:05,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44013605442176873 [2023-08-29 20:38:05,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-29 20:38:05,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-29 20:38:05,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:05,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-29 20:38:05,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,858 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,858 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 134 flow. Second operand 5 states and 647 transitions. [2023-08-29 20:38:05,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 352 flow [2023-08-29 20:38:05,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:05,861 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 194 flow [2023-08-29 20:38:05,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-29 20:38:05,861 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2023-08-29 20:38:05,862 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 194 flow [2023-08-29 20:38:05,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:05,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:05,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:05,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:38:05,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:05,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1741843142, now seen corresponding path program 1 times [2023-08-29 20:38:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:05,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795062240] [2023-08-29 20:38:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:06,025 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-29 20:38:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795062240] [2023-08-29 20:38:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795062240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:06,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605085362] [2023-08-29 20:38:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:06,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:38:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:38:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:38:06,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 294 [2023-08-29 20:38:06,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:06,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 294 [2023-08-29 20:38:06,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:06,342 INFO L130 PetriNetUnfolder]: 1636/2706 cut-off events. [2023-08-29 20:38:06,343 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2023-08-29 20:38:06,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7591 conditions, 2706 events. 1636/2706 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16563 event pairs, 590 based on Foata normal form. 30/2525 useless extension candidates. Maximal degree in co-relation 7582. Up to 1632 conditions per place. [2023-08-29 20:38:06,352 INFO L137 encePairwiseOnDemand]: 291/294 looper letters, 53 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-29 20:38:06,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 361 flow [2023-08-29 20:38:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-29 20:38:06,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45068027210884354 [2023-08-29 20:38:06,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-29 20:38:06,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-29 20:38:06,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:06,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-29 20:38:06,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,357 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,357 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 194 flow. Second operand 4 states and 530 transitions. [2023-08-29 20:38:06,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 361 flow [2023-08-29 20:38:06,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 354 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:06,368 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 189 flow [2023-08-29 20:38:06,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-29 20:38:06,369 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 20:38:06,369 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 189 flow [2023-08-29 20:38:06,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:06,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:06,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:38:06,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:06,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1545977955, now seen corresponding path program 1 times [2023-08-29 20:38:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472288390] [2023-08-29 20:38:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:06,493 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-29 20:38:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472288390] [2023-08-29 20:38:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472288390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336129428] [2023-08-29 20:38:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:06,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:06,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 294 [2023-08-29 20:38:06,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:06,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 294 [2023-08-29 20:38:06,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:06,725 INFO L130 PetriNetUnfolder]: 1536/2510 cut-off events. [2023-08-29 20:38:06,725 INFO L131 PetriNetUnfolder]: For 1695/1719 co-relation queries the response was YES. [2023-08-29 20:38:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 2510 events. 1536/2510 cut-off events. For 1695/1719 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 14624 event pairs, 714 based on Foata normal form. 11/2281 useless extension candidates. Maximal degree in co-relation 7157. Up to 1706 conditions per place. [2023-08-29 20:38:06,735 INFO L137 encePairwiseOnDemand]: 291/294 looper letters, 59 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-29 20:38:06,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 444 flow [2023-08-29 20:38:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-29 20:38:06,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47278911564625853 [2023-08-29 20:38:06,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-29 20:38:06,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-29 20:38:06,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:06,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-29 20:38:06,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,739 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 189 flow. Second operand 3 states and 417 transitions. [2023-08-29 20:38:06,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 444 flow [2023-08-29 20:38:06,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:06,746 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 193 flow [2023-08-29 20:38:06,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-29 20:38:06,746 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2023-08-29 20:38:06,747 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 193 flow [2023-08-29 20:38:06,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:06,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:06,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:06,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:38:06,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:06,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2085021474, now seen corresponding path program 1 times [2023-08-29 20:38:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552763364] [2023-08-29 20:38:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:06,875 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-29 20:38:06,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552763364] [2023-08-29 20:38:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552763364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173685742] [2023-08-29 20:38:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:06,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:06,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:06,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:06,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-29 20:38:06,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 193 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-29 20:38:06,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:06,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-29 20:38:06,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:07,253 INFO L130 PetriNetUnfolder]: 2527/4148 cut-off events. [2023-08-29 20:38:07,254 INFO L131 PetriNetUnfolder]: For 3049/3102 co-relation queries the response was YES. [2023-08-29 20:38:07,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12158 conditions, 4148 events. 2527/4148 cut-off events. For 3049/3102 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27296 event pairs, 779 based on Foata normal form. 30/3770 useless extension candidates. Maximal degree in co-relation 12149. Up to 1466 conditions per place. [2023-08-29 20:38:07,271 INFO L137 encePairwiseOnDemand]: 290/294 looper letters, 74 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2023-08-29 20:38:07,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 526 flow [2023-08-29 20:38:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-08-29 20:38:07,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2023-08-29 20:38:07,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-08-29 20:38:07,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-08-29 20:38:07,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:07,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-08-29 20:38:07,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,278 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 193 flow. Second operand 4 states and 553 transitions. [2023-08-29 20:38:07,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 526 flow [2023-08-29 20:38:07,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:07,288 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 208 flow [2023-08-29 20:38:07,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-29 20:38:07,289 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2023-08-29 20:38:07,290 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 208 flow [2023-08-29 20:38:07,290 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-29 20:38:07,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:07,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:07,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:38:07,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:07,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 711829920, now seen corresponding path program 1 times [2023-08-29 20:38:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520423778] [2023-08-29 20:38:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:07,414 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-29 20:38:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520423778] [2023-08-29 20:38:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520423778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845623369] [2023-08-29 20:38:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:07,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:07,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 294 [2023-08-29 20:38:07,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:07,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 294 [2023-08-29 20:38:07,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:07,793 INFO L130 PetriNetUnfolder]: 2018/3218 cut-off events. [2023-08-29 20:38:07,793 INFO L131 PetriNetUnfolder]: For 1850/1858 co-relation queries the response was YES. [2023-08-29 20:38:07,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10101 conditions, 3218 events. 2018/3218 cut-off events. For 1850/1858 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 19200 event pairs, 737 based on Foata normal form. 49/2989 useless extension candidates. Maximal degree in co-relation 10090. Up to 1273 conditions per place. [2023-08-29 20:38:07,808 INFO L137 encePairwiseOnDemand]: 282/294 looper letters, 44 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2023-08-29 20:38:07,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 416 flow [2023-08-29 20:38:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-29 20:38:07,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2023-08-29 20:38:07,811 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-29 20:38:07,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-29 20:38:07,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:07,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-29 20:38:07,812 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-29 20:38:07,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,814 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,814 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 208 flow. Second operand 4 states and 516 transitions. [2023-08-29 20:38:07,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 416 flow [2023-08-29 20:38:07,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:07,825 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 314 flow [2023-08-29 20:38:07,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-29 20:38:07,827 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2023-08-29 20:38:07,827 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 314 flow [2023-08-29 20:38:07,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:07,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:07,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:07,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:38:07,828 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:07,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash 591892297, now seen corresponding path program 1 times [2023-08-29 20:38:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318692708] [2023-08-29 20:38:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318692708] [2023-08-29 20:38:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318692708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:38:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456107008] [2023-08-29 20:38:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:08,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:38:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:38:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:38:08,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 294 [2023-08-29 20:38:08,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 314 flow. Second operand has 9 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:08,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:08,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 294 [2023-08-29 20:38:08,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:09,055 INFO L130 PetriNetUnfolder]: 2488/4112 cut-off events. [2023-08-29 20:38:09,055 INFO L131 PetriNetUnfolder]: For 5334/5437 co-relation queries the response was YES. [2023-08-29 20:38:09,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 4112 events. 2488/4112 cut-off events. For 5334/5437 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 27064 event pairs, 881 based on Foata normal form. 24/3872 useless extension candidates. Maximal degree in co-relation 13954. Up to 2204 conditions per place. [2023-08-29 20:38:09,072 INFO L137 encePairwiseOnDemand]: 286/294 looper letters, 84 selfloop transitions, 17 changer transitions 2/112 dead transitions. [2023-08-29 20:38:09,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 862 flow [2023-08-29 20:38:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:38:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:38:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 962 transitions. [2023-08-29 20:38:09,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40901360544217685 [2023-08-29 20:38:09,075 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 962 transitions. [2023-08-29 20:38:09,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 962 transitions. [2023-08-29 20:38:09,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:09,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 962 transitions. [2023-08-29 20:38:09,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,081 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,081 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 314 flow. Second operand 8 states and 962 transitions. [2023-08-29 20:38:09,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 862 flow [2023-08-29 20:38:09,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 855 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:09,098 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 513 flow [2023-08-29 20:38:09,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=513, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2023-08-29 20:38:09,099 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2023-08-29 20:38:09,099 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 513 flow [2023-08-29 20:38:09,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:09,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:09,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:38:09,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:09,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 591892246, now seen corresponding path program 1 times [2023-08-29 20:38:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739976564] [2023-08-29 20:38:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:09,268 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-29 20:38:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739976564] [2023-08-29 20:38:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739976564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:38:09,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680376265] [2023-08-29 20:38:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:09,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:38:09,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:38:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:38:09,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 294 [2023-08-29 20:38:09,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 513 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:09,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 294 [2023-08-29 20:38:09,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:09,789 INFO L130 PetriNetUnfolder]: 2329/3751 cut-off events. [2023-08-29 20:38:09,789 INFO L131 PetriNetUnfolder]: For 6723/6739 co-relation queries the response was YES. [2023-08-29 20:38:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13948 conditions, 3751 events. 2329/3751 cut-off events. For 6723/6739 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 23400 event pairs, 718 based on Foata normal form. 87/3718 useless extension candidates. Maximal degree in co-relation 13931. Up to 1450 conditions per place. [2023-08-29 20:38:09,807 INFO L137 encePairwiseOnDemand]: 281/294 looper letters, 60 selfloop transitions, 28 changer transitions 0/92 dead transitions. [2023-08-29 20:38:09,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 846 flow [2023-08-29 20:38:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:38:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:38:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-08-29 20:38:09,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41950113378684806 [2023-08-29 20:38:09,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-08-29 20:38:09,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-08-29 20:38:09,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:09,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-08-29 20:38:09,811 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-29 20:38:09,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,813 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 513 flow. Second operand 6 states and 740 transitions. [2023-08-29 20:38:09,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 846 flow [2023-08-29 20:38:09,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 92 transitions, 844 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:09,841 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 675 flow [2023-08-29 20:38:09,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2023-08-29 20:38:09,842 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 5 predicate places. [2023-08-29 20:38:09,842 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 675 flow [2023-08-29 20:38:09,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:09,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:09,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:09,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:38:09,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:09,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash 240258582, now seen corresponding path program 1 times [2023-08-29 20:38:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434835823] [2023-08-29 20:38:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:10,021 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-29 20:38:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434835823] [2023-08-29 20:38:10,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434835823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726904776] [2023-08-29 20:38:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:10,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:38:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:38:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:38:10,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 294 [2023-08-29 20:38:10,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 675 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:10,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:10,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 294 [2023-08-29 20:38:10,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:10,803 INFO L130 PetriNetUnfolder]: 4984/7854 cut-off events. [2023-08-29 20:38:10,803 INFO L131 PetriNetUnfolder]: For 25386/25426 co-relation queries the response was YES. [2023-08-29 20:38:10,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31108 conditions, 7854 events. 4984/7854 cut-off events. For 25386/25426 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 51193 event pairs, 791 based on Foata normal form. 88/7671 useless extension candidates. Maximal degree in co-relation 31089. Up to 3344 conditions per place. [2023-08-29 20:38:10,847 INFO L137 encePairwiseOnDemand]: 283/294 looper letters, 132 selfloop transitions, 35 changer transitions 0/170 dead transitions. [2023-08-29 20:38:10,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 170 transitions, 2103 flow [2023-08-29 20:38:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-29 20:38:10,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496598639455782 [2023-08-29 20:38:10,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-29 20:38:10,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-29 20:38:10,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:10,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-29 20:38:10,851 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-29 20:38:10,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:10,853 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:10,853 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 675 flow. Second operand 5 states and 661 transitions. [2023-08-29 20:38:10,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 170 transitions, 2103 flow [2023-08-29 20:38:11,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 170 transitions, 1994 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:38:11,004 INFO L231 Difference]: Finished difference. Result has 75 places, 99 transitions, 1225 flow [2023-08-29 20:38:11,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1225, PETRI_PLACES=75, PETRI_TRANSITIONS=99} [2023-08-29 20:38:11,006 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2023-08-29 20:38:11,006 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 99 transitions, 1225 flow [2023-08-29 20:38:11,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:11,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:11,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:11,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:38:11,007 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:11,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1696683001, now seen corresponding path program 1 times [2023-08-29 20:38:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713646384] [2023-08-29 20:38:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:11,352 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-29 20:38:11,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:11,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713646384] [2023-08-29 20:38:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713646384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:11,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:38:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778238135] [2023-08-29 20:38:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:11,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:38:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:38:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:38:11,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 294 [2023-08-29 20:38:11,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 99 transitions, 1225 flow. Second operand has 10 states, 10 states have (on average 109.5) internal successors, (1095), 10 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:11,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:11,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 294 [2023-08-29 20:38:11,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:12,533 INFO L130 PetriNetUnfolder]: 5095/8224 cut-off events. [2023-08-29 20:38:12,533 INFO L131 PetriNetUnfolder]: For 30820/30987 co-relation queries the response was YES. [2023-08-29 20:38:12,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36436 conditions, 8224 events. 5095/8224 cut-off events. For 30820/30987 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 54405 event pairs, 2098 based on Foata normal form. 19/7989 useless extension candidates. Maximal degree in co-relation 36413. Up to 3224 conditions per place. [2023-08-29 20:38:12,568 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 119 selfloop transitions, 39 changer transitions 4/179 dead transitions. [2023-08-29 20:38:12,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 179 transitions, 2130 flow [2023-08-29 20:38:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:38:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:38:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1167 transitions. [2023-08-29 20:38:12,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39693877551020407 [2023-08-29 20:38:12,571 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1167 transitions. [2023-08-29 20:38:12,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1167 transitions. [2023-08-29 20:38:12,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:12,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1167 transitions. [2023-08-29 20:38:12,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.7) internal successors, (1167), 10 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:12,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:12,576 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:12,577 INFO L175 Difference]: Start difference. First operand has 75 places, 99 transitions, 1225 flow. Second operand 10 states and 1167 transitions. [2023-08-29 20:38:12,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 179 transitions, 2130 flow [2023-08-29 20:38:12,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 179 transitions, 2124 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:12,851 INFO L231 Difference]: Finished difference. Result has 90 places, 121 transitions, 1694 flow [2023-08-29 20:38:12,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1694, PETRI_PLACES=90, PETRI_TRANSITIONS=121} [2023-08-29 20:38:12,852 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 23 predicate places. [2023-08-29 20:38:12,852 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 121 transitions, 1694 flow [2023-08-29 20:38:12,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.5) internal successors, (1095), 10 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:12,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:12,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:12,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:38:12,853 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:12,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1168792919, now seen corresponding path program 1 times [2023-08-29 20:38:12,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:12,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374667439] [2023-08-29 20:38:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:12,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:12,910 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-29 20:38:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:12,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374667439] [2023-08-29 20:38:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374667439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:12,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:12,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719148764] [2023-08-29 20:38:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:12,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:12,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 294 [2023-08-29 20:38:12,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 121 transitions, 1694 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:12,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:12,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 294 [2023-08-29 20:38:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:13,799 INFO L130 PetriNetUnfolder]: 4580/7235 cut-off events. [2023-08-29 20:38:13,799 INFO L131 PetriNetUnfolder]: For 40063/40127 co-relation queries the response was YES. [2023-08-29 20:38:13,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33737 conditions, 7235 events. 4580/7235 cut-off events. For 40063/40127 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 46599 event pairs, 2393 based on Foata normal form. 134/7278 useless extension candidates. Maximal degree in co-relation 33707. Up to 5180 conditions per place. [2023-08-29 20:38:13,826 INFO L137 encePairwiseOnDemand]: 282/294 looper letters, 32 selfloop transitions, 20 changer transitions 72/131 dead transitions. [2023-08-29 20:38:13,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 131 transitions, 2038 flow [2023-08-29 20:38:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-29 20:38:13,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43537414965986393 [2023-08-29 20:38:13,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-29 20:38:13,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-29 20:38:13,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:13,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-29 20:38:13,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-29 20:38:13,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:13,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:13,831 INFO L175 Difference]: Start difference. First operand has 90 places, 121 transitions, 1694 flow. Second operand 4 states and 512 transitions. [2023-08-29 20:38:13,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 131 transitions, 2038 flow [2023-08-29 20:38:14,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 2024 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-29 20:38:14,129 INFO L231 Difference]: Finished difference. Result has 93 places, 54 transitions, 613 flow [2023-08-29 20:38:14,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=613, PETRI_PLACES=93, PETRI_TRANSITIONS=54} [2023-08-29 20:38:14,129 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 26 predicate places. [2023-08-29 20:38:14,130 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 54 transitions, 613 flow [2023-08-29 20:38:14,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:14,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:14,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:14,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:38:14,130 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:14,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash 507202727, now seen corresponding path program 1 times [2023-08-29 20:38:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:14,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374421737] [2023-08-29 20:38:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:14,911 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-29 20:38:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374421737] [2023-08-29 20:38:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374421737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:14,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:38:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560943604] [2023-08-29 20:38:14,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:14,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:38:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:38:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:38:15,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 294 [2023-08-29 20:38:15,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 54 transitions, 613 flow. Second operand has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:15,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 294 [2023-08-29 20:38:15,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:15,648 INFO L130 PetriNetUnfolder]: 1592/2626 cut-off events. [2023-08-29 20:38:15,649 INFO L131 PetriNetUnfolder]: For 6700/6726 co-relation queries the response was YES. [2023-08-29 20:38:15,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9220 conditions, 2626 events. 1592/2626 cut-off events. For 6700/6726 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14366 event pairs, 547 based on Foata normal form. 38/2652 useless extension candidates. Maximal degree in co-relation 9188. Up to 1889 conditions per place. [2023-08-29 20:38:15,658 INFO L137 encePairwiseOnDemand]: 283/294 looper letters, 64 selfloop transitions, 23 changer transitions 1/93 dead transitions. [2023-08-29 20:38:15,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 1001 flow [2023-08-29 20:38:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:38:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:38:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1155 transitions. [2023-08-29 20:38:15,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2023-08-29 20:38:15,661 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1155 transitions. [2023-08-29 20:38:15,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1155 transitions. [2023-08-29 20:38:15,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:15,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1155 transitions. [2023-08-29 20:38:15,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,666 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,666 INFO L175 Difference]: Start difference. First operand has 93 places, 54 transitions, 613 flow. Second operand 10 states and 1155 transitions. [2023-08-29 20:38:15,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 1001 flow [2023-08-29 20:38:15,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 834 flow, removed 28 selfloop flow, removed 16 redundant places. [2023-08-29 20:38:15,704 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 659 flow [2023-08-29 20:38:15,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=659, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2023-08-29 20:38:15,705 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 16 predicate places. [2023-08-29 20:38:15,705 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 659 flow [2023-08-29 20:38:15,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:15,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:15,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:15,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:38:15,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:15,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash 341999323, now seen corresponding path program 2 times [2023-08-29 20:38:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003393143] [2023-08-29 20:38:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:16,483 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-29 20:38:16,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:16,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003393143] [2023-08-29 20:38:16,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003393143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:16,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:16,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:38:16,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905797843] [2023-08-29 20:38:16,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:16,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:38:16,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:16,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:38:16,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:38:16,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 294 [2023-08-29 20:38:16,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 659 flow. Second operand has 9 states, 9 states have (on average 109.55555555555556) internal successors, (986), 9 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:16,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:16,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 294 [2023-08-29 20:38:16,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:17,176 INFO L130 PetriNetUnfolder]: 1584/2627 cut-off events. [2023-08-29 20:38:17,176 INFO L131 PetriNetUnfolder]: For 3863/3881 co-relation queries the response was YES. [2023-08-29 20:38:17,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8619 conditions, 2627 events. 1584/2627 cut-off events. For 3863/3881 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14501 event pairs, 316 based on Foata normal form. 22/2623 useless extension candidates. Maximal degree in co-relation 8596. Up to 1685 conditions per place. [2023-08-29 20:38:17,185 INFO L137 encePairwiseOnDemand]: 285/294 looper letters, 59 selfloop transitions, 24 changer transitions 5/93 dead transitions. [2023-08-29 20:38:17,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 93 transitions, 928 flow [2023-08-29 20:38:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:38:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:38:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1144 transitions. [2023-08-29 20:38:17,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3891156462585034 [2023-08-29 20:38:17,199 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1144 transitions. [2023-08-29 20:38:17,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1144 transitions. [2023-08-29 20:38:17,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:17,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1144 transitions. [2023-08-29 20:38:17,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.4) internal successors, (1144), 10 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,204 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 294.0) internal successors, (3234), 11 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,205 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 659 flow. Second operand 10 states and 1144 transitions. [2023-08-29 20:38:17,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 93 transitions, 928 flow [2023-08-29 20:38:17,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 906 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-08-29 20:38:17,223 INFO L231 Difference]: Finished difference. Result has 93 places, 67 transitions, 705 flow [2023-08-29 20:38:17,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=705, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2023-08-29 20:38:17,223 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 26 predicate places. [2023-08-29 20:38:17,223 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 705 flow [2023-08-29 20:38:17,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.55555555555556) internal successors, (986), 9 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:17,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:17,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:38:17,229 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:17,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1214122784, now seen corresponding path program 1 times [2023-08-29 20:38:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508223681] [2023-08-29 20:38:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:17,380 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-29 20:38:17,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508223681] [2023-08-29 20:38:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508223681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:17,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057117091] [2023-08-29 20:38:17,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:17,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:17,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:17,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:17,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-29 20:38:17,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 705 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-29 20:38:17,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:17,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-29 20:38:17,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:17,549 INFO L130 PetriNetUnfolder]: 826/1535 cut-off events. [2023-08-29 20:38:17,549 INFO L131 PetriNetUnfolder]: For 3179/3191 co-relation queries the response was YES. [2023-08-29 20:38:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5213 conditions, 1535 events. 826/1535 cut-off events. For 3179/3191 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9069 event pairs, 245 based on Foata normal form. 40/1565 useless extension candidates. Maximal degree in co-relation 5188. Up to 1405 conditions per place. [2023-08-29 20:38:17,554 INFO L137 encePairwiseOnDemand]: 289/294 looper letters, 58 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-08-29 20:38:17,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 80 transitions, 906 flow [2023-08-29 20:38:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-29 20:38:17,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45691609977324266 [2023-08-29 20:38:17,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-29 20:38:17,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-29 20:38:17,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:17,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-29 20:38:17,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,558 INFO L175 Difference]: Start difference. First operand has 93 places, 67 transitions, 705 flow. Second operand 3 states and 403 transitions. [2023-08-29 20:38:17,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 80 transitions, 906 flow [2023-08-29 20:38:17,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 80 transitions, 861 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:38:17,567 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 690 flow [2023-08-29 20:38:17,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2023-08-29 20:38:17,567 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 23 predicate places. [2023-08-29 20:38:17,567 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 690 flow [2023-08-29 20:38:17,567 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-29 20:38:17,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:17,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:17,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:38:17,568 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:17,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1970955037, now seen corresponding path program 1 times [2023-08-29 20:38:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:17,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001404118] [2023-08-29 20:38:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:17,691 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-29 20:38:17,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:17,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001404118] [2023-08-29 20:38:17,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001404118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:17,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:17,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504704194] [2023-08-29 20:38:17,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:17,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:17,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:17,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-29 20:38:17,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 690 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-29 20:38:17,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:17,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-29 20:38:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:17,801 INFO L130 PetriNetUnfolder]: 293/693 cut-off events. [2023-08-29 20:38:17,801 INFO L131 PetriNetUnfolder]: For 1395/1423 co-relation queries the response was YES. [2023-08-29 20:38:17,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 693 events. 293/693 cut-off events. For 1395/1423 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4021 event pairs, 40 based on Foata normal form. 78/765 useless extension candidates. Maximal degree in co-relation 2644. Up to 461 conditions per place. [2023-08-29 20:38:17,804 INFO L137 encePairwiseOnDemand]: 289/294 looper letters, 55 selfloop transitions, 7 changer transitions 2/79 dead transitions. [2023-08-29 20:38:17,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 79 transitions, 772 flow [2023-08-29 20:38:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-29 20:38:17,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2023-08-29 20:38:17,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-29 20:38:17,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-29 20:38:17,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:17,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-29 20:38:17,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,808 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,808 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 690 flow. Second operand 4 states and 534 transitions. [2023-08-29 20:38:17,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 79 transitions, 772 flow [2023-08-29 20:38:17,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 79 transitions, 750 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:17,812 INFO L231 Difference]: Finished difference. Result has 92 places, 63 transitions, 543 flow [2023-08-29 20:38:17,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=543, PETRI_PLACES=92, PETRI_TRANSITIONS=63} [2023-08-29 20:38:17,813 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2023-08-29 20:38:17,813 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 63 transitions, 543 flow [2023-08-29 20:38:17,813 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-29 20:38:17,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:17,813 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-29 20:38:17,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:38:17,813 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:17,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash -304069471, now seen corresponding path program 1 times [2023-08-29 20:38:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:17,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343855746] [2023-08-29 20:38:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:17,970 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-29 20:38:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:38:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343855746] [2023-08-29 20:38:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343855746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387405376] [2023-08-29 20:38:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:17,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:38:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:17,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-29 20:38:17,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 63 transitions, 543 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:17,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:17,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-29 20:38:17,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:18,052 INFO L130 PetriNetUnfolder]: 144/364 cut-off events. [2023-08-29 20:38:18,052 INFO L131 PetriNetUnfolder]: For 872/920 co-relation queries the response was YES. [2023-08-29 20:38:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 364 events. 144/364 cut-off events. For 872/920 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1890 event pairs, 11 based on Foata normal form. 77/437 useless extension candidates. Maximal degree in co-relation 1507. Up to 172 conditions per place. [2023-08-29 20:38:18,053 INFO L137 encePairwiseOnDemand]: 289/294 looper letters, 40 selfloop transitions, 10 changer transitions 2/62 dead transitions. [2023-08-29 20:38:18,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 62 transitions, 553 flow [2023-08-29 20:38:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-29 20:38:18,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2023-08-29 20:38:18,055 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-29 20:38:18,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-29 20:38:18,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:18,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-29 20:38:18,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:18,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:18,058 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:18,058 INFO L175 Difference]: Start difference. First operand has 92 places, 63 transitions, 543 flow. Second operand 5 states and 655 transitions. [2023-08-29 20:38:18,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 62 transitions, 553 flow [2023-08-29 20:38:18,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 458 flow, removed 18 selfloop flow, removed 20 redundant places. [2023-08-29 20:38:18,060 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 293 flow [2023-08-29 20:38:18,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2023-08-29 20:38:18,061 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2023-08-29 20:38:18,061 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 293 flow [2023-08-29 20:38:18,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:18,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:18,061 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-29 20:38:18,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:38:18,061 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:18,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1868190883, now seen corresponding path program 1 times [2023-08-29 20:38:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:38:18,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993680469] [2023-08-29 20:38:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:38:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:18,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:38:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:18,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:38:18,152 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:38:18,153 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-08-29 20:38:18,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-08-29 20:38:18,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-08-29 20:38:18,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-08-29 20:38:18,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-08-29 20:38:18,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-08-29 20:38:18,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-08-29 20:38:18,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-08-29 20:38:18,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:38:18,159 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:18,163 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:38:18,164 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:38:18,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:38:18 BasicIcfg [2023-08-29 20:38:18,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:38:18,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:38:18,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:38:18,208 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:38:18,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:37:55" (3/4) ... [2023-08-29 20:38:18,210 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:38:18,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:38:18,210 INFO L158 Benchmark]: Toolchain (without parser) took 23702.49ms. Allocated memory was 75.5MB in the beginning and 1.9GB in the end (delta: 1.9GB). Free memory was 49.3MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 591.6MB. Max. memory is 16.1GB. [2023-08-29 20:38:18,210 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:18,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.03ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 45.3MB in the end (delta: 3.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-29 20:38:18,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.37ms. Allocated memory is still 75.5MB. Free memory was 45.3MB in the beginning and 42.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:18,211 INFO L158 Benchmark]: Boogie Preprocessor took 42.93ms. Allocated memory is still 75.5MB. Free memory was 42.8MB in the beginning and 40.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:18,211 INFO L158 Benchmark]: RCFGBuilder took 706.98ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 40.6MB in the beginning and 53.8MB in the end (delta: -13.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2023-08-29 20:38:18,211 INFO L158 Benchmark]: TraceAbstraction took 22541.86ms. Allocated memory was 98.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 52.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 571.5MB. Max. memory is 16.1GB. [2023-08-29 20:38:18,211 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:18,212 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.16ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.03ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 45.3MB in the end (delta: 3.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.37ms. Allocated memory is still 75.5MB. Free memory was 45.3MB in the beginning and 42.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.93ms. Allocated memory is still 75.5MB. Free memory was 42.8MB in the beginning and 40.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 706.98ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 40.6MB in the beginning and 53.8MB in the end (delta: -13.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22541.86ms. Allocated memory was 98.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 52.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 571.5MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 1.9GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 164 PlacesBefore, 67 PlacesAfterwards, 156 TransitionsBefore, 58 TransitionsAfterwards, 4408 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 18659 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7229, independent: 6775, independent conditional: 0, independent unconditional: 6775, dependent: 454, dependent conditional: 0, dependent unconditional: 454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2118, independent: 2048, independent conditional: 0, independent unconditional: 2048, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7229, independent: 4727, independent conditional: 0, independent unconditional: 4727, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 2118, unknown conditional: 0, unknown unconditional: 2118] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 345, Positive conditional cache size: 0, Positive unconditional cache size: 345, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1949, ((void *)0), P0, ((void *)0))=1, t1949={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1950, ((void *)0), P1, ((void *)0))=2, t1949={4:0}, t1950={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1951, ((void *)0), P2, ((void *)0))=3, t1949={4:0}, t1950={5:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949={4:0}, t1950={5:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L858] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: 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, 201 locations, 53 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2183 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1663 mSDsluCounter, 812 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 686 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4954 IncrementalHoareTripleChecker+Invalid, 5222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 126 mSDtfsCounter, 4954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1694occurred in iteration=14, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:38:18,249 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/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.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 d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:38:20,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:38:20,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:38:20,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:38:20,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:38:20,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:38:20,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:38:20,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:38:20,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:38:20,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:38:20,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:38:20,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:38:20,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:38:20,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:38:20,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:38:20,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:38:20,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:38:20,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:38:20,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:38:20,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:38:20,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:38:20,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:38:20,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:38:20,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:38:20,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:38:20,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:38:20,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:38:20,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:38:20,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:38:20,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:38:20,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:38:20,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:38:20,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:38:20,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:38:20,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:38:20,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:38:20,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:38:20,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:38:20,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:38:20,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:38:20,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:38:20,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:38:20,238 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:38:20,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:38:20,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:38:20,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:38:20,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:38:20,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:38:20,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:38:20,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:38:20,242 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:38:20,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:38:20,242 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:38:20,243 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:38:20,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:38:20,244 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:38:20,244 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:38:20,244 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:38:20,244 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:38:20,244 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:38:20,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:38:20,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:38:20,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:38:20,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:38:20,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:38:20,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:38:20,245 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:38:20,246 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:38:20,246 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:38:20,246 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:38:20,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:38:20,246 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:38:20,246 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:38:20,247 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 -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 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 -> AFTER [2023-08-29 20:38:20,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:38:20,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:38:20,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:38:20,528 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:38:20,529 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:38:20,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2023-08-29 20:38:21,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:38:21,723 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:38:21,723 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2023-08-29 20:38:21,734 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6bdbd02/7708abd8266e4e588e1f84ab2dcadfe6/FLAGc5c19d0b1 [2023-08-29 20:38:21,748 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6bdbd02/7708abd8266e4e588e1f84ab2dcadfe6 [2023-08-29 20:38:21,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:38:21,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:38:21,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:38:21,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:38:21,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:38:21,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:38:21" (1/1) ... [2023-08-29 20:38:21,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d41233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:21, skipping insertion in model container [2023-08-29 20:38:21,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:38:21" (1/1) ... [2023-08-29 20:38:21,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:38:21,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:38:21,897 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/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-29 20:38:21,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:38:22,007 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:38:22,016 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/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2023-08-29 20:38:22,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:38:22,066 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:38:22,067 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:38:22,071 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:38:22,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22 WrapperNode [2023-08-29 20:38:22,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:38:22,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:38:22,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:38:22,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:38:22,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,104 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2023-08-29 20:38:22,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:38:22,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:38:22,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:38:22,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:38:22,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:38:22,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:38:22,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:38:22,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:38:22,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (1/1) ... [2023-08-29 20:38:22,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:38:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:38:22,152 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-29 20:38:22,160 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-29 20:38:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:38:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:38:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:38:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:38:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:38:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:38:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:38:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:38:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:38:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:38:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:38:22,196 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:38:22,299 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:38:22,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:38:22,786 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:38:23,065 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:38:23,065 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:38:23,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:23 BoogieIcfgContainer [2023-08-29 20:38:23,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:38:23,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:38:23,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:38:23,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:38:23,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:38:21" (1/3) ... [2023-08-29 20:38:23,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57ad4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:38:23, skipping insertion in model container [2023-08-29 20:38:23,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:38:22" (2/3) ... [2023-08-29 20:38:23,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57ad4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:38:23, skipping insertion in model container [2023-08-29 20:38:23,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:23" (3/3) ... [2023-08-29 20:38:23,075 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2023-08-29 20:38:23,088 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:38:23,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-08-29 20:38:23,089 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:38:23,174 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:38:23,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 335 flow [2023-08-29 20:38:23,267 INFO L130 PetriNetUnfolder]: 2/157 cut-off events. [2023-08-29 20:38:23,267 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:23,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 2/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:38:23,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 335 flow [2023-08-29 20:38:23,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 157 transitions, 323 flow [2023-08-29 20:38:23,279 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:38:23,285 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 157 transitions, 323 flow [2023-08-29 20:38:23,287 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 157 transitions, 323 flow [2023-08-29 20:38:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 157 transitions, 323 flow [2023-08-29 20:38:23,309 INFO L130 PetriNetUnfolder]: 2/157 cut-off events. [2023-08-29 20:38:23,309 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 157 events. 2/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:38:23,311 INFO L119 LiptonReduction]: Number of co-enabled transitions 4408 [2023-08-29 20:38:33,495 INFO L134 LiptonReduction]: Checked pairs total: 18659 [2023-08-29 20:38:33,496 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-29 20:38:33,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:38:33,514 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;@128ffc55, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:38:33,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-08-29 20:38:33,517 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:38:33,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:33,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:33,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:38:33,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:33,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 802, now seen corresponding path program 1 times [2023-08-29 20:38:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:33,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173745373] [2023-08-29 20:38:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:33,533 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-29 20:38:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:33,553 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-29 20:38:33,565 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-29 20:38:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:33,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:38:33,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:33,650 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-29 20:38:33,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:33,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173745373] [2023-08-29 20:38:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173745373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:33,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:38:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749356917] [2023-08-29 20:38:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:33,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:38:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:38:33,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:38:33,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 294 [2023-08-29 20:38:33,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:33,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:33,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 294 [2023-08-29 20:38:33,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:34,484 INFO L130 PetriNetUnfolder]: 5006/7291 cut-off events. [2023-08-29 20:38:34,484 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 20:38:34,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14545 conditions, 7291 events. 5006/7291 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 45588 event pairs, 5006 based on Foata normal form. 135/4018 useless extension candidates. Maximal degree in co-relation 14534. Up to 7208 conditions per place. [2023-08-29 20:38:34,521 INFO L137 encePairwiseOnDemand]: 277/294 looper letters, 35 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2023-08-29 20:38:34,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 161 flow [2023-08-29 20:38:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:38:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:38:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2023-08-29 20:38:34,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-29 20:38:34,532 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2023-08-29 20:38:34,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2023-08-29 20:38:34,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:34,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2023-08-29 20:38:34,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:34,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:34,540 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:34,542 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 2 states and 308 transitions. [2023-08-29 20:38:34,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 161 flow [2023-08-29 20:38:34,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:34,545 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 88 flow [2023-08-29 20:38:34,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-29 20:38:34,549 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 20:38:34,549 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 88 flow [2023-08-29 20:38:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:34,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:34,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:38:34,559 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-29 20:38:34,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-29 20:38:34,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:34,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 792111, now seen corresponding path program 1 times [2023-08-29 20:38:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477198221] [2023-08-29 20:38:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:34,757 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-29 20:38:34,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:34,773 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-29 20:38:34,775 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-29 20:38:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:34,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:38:34,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:34,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:38:34,926 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-29 20:38:34,971 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-29 20:38:34,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:34,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477198221] [2023-08-29 20:38:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477198221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:34,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:34,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:34,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661437071] [2023-08-29 20:38:34,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:34,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:34,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:35,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-29 20:38:35,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:35,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-29 20:38:35,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:35,344 INFO L130 PetriNetUnfolder]: 2237/3346 cut-off events. [2023-08-29 20:38:35,344 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:35,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6661 conditions, 3346 events. 2237/3346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 18986 event pairs, 2237 based on Foata normal form. 0/2180 useless extension candidates. Maximal degree in co-relation 6658. Up to 3278 conditions per place. [2023-08-29 20:38:35,359 INFO L137 encePairwiseOnDemand]: 287/294 looper letters, 28 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-29 20:38:35,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 134 flow [2023-08-29 20:38:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:38:35,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47165532879818595 [2023-08-29 20:38:35,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:38:35,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:38:35,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:35,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:38:35,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,370 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 88 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:38:35,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 134 flow [2023-08-29 20:38:35,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:38:35,371 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2023-08-29 20:38:35,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, 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-29 20:38:35,372 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 20:38:35,372 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2023-08-29 20:38:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:35,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:35,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:38:35,387 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-29 20:38:35,580 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-29 20:38:35,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:35,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 792110, now seen corresponding path program 1 times [2023-08-29 20:38:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120178504] [2023-08-29 20:38:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:35,582 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-29 20:38:35,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:35,583 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-29 20:38:35,585 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-29 20:38:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:35,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:38:35,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:35,669 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 20:38:35,670 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-29 20:38:35,700 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-29 20:38:35,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:35,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:35,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120178504] [2023-08-29 20:38:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120178504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:35,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:38:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106621181] [2023-08-29 20:38:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:35,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:35,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:35,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 294 [2023-08-29 20:38:35,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 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-29 20:38:35,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:35,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 294 [2023-08-29 20:38:35,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:36,002 INFO L130 PetriNetUnfolder]: 1309/1992 cut-off events. [2023-08-29 20:38:36,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:38:36,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 1992 events. 1309/1992 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10261 event pairs, 773 based on Foata normal form. 72/1643 useless extension candidates. Maximal degree in co-relation 3977. Up to 1053 conditions per place. [2023-08-29 20:38:36,010 INFO L137 encePairwiseOnDemand]: 286/294 looper letters, 32 selfloop transitions, 2 changer transitions 1/40 dead transitions. [2023-08-29 20:38:36,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 158 flow [2023-08-29 20:38:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-29 20:38:36,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2023-08-29 20:38:36,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-29 20:38:36,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-29 20:38:36,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:36,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-29 20:38:36,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,016 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 413 transitions. [2023-08-29 20:38:36,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 158 flow [2023-08-29 20:38:36,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:36,017 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 85 flow [2023-08-29 20:38:36,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, 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=85, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-29 20:38:36,018 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 20:38:36,018 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 85 flow [2023-08-29 20:38:36,018 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-29 20:38:36,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:36,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:36,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:38:36,225 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-29 20:38:36,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:36,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -951862728, now seen corresponding path program 1 times [2023-08-29 20:38:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:36,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116729572] [2023-08-29 20:38:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:36,228 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-29 20:38:36,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:36,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-29 20:38:36,236 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-29 20:38:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:36,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:38:36,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:36,347 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-29 20:38:36,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:36,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116729572] [2023-08-29 20:38:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116729572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:36,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:38:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483716254] [2023-08-29 20:38:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:36,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:38:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:36,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:38:36,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:38:36,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 294 [2023-08-29 20:38:36,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 85 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-29 20:38:36,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:36,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 294 [2023-08-29 20:38:36,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:36,505 INFO L130 PetriNetUnfolder]: 574/972 cut-off events. [2023-08-29 20:38:36,505 INFO L131 PetriNetUnfolder]: For 48/60 co-relation queries the response was YES. [2023-08-29 20:38:36,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 972 events. 574/972 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4851 event pairs, 186 based on Foata normal form. 12/840 useless extension candidates. Maximal degree in co-relation 2088. Up to 906 conditions per place. [2023-08-29 20:38:36,512 INFO L137 encePairwiseOnDemand]: 289/294 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-29 20:38:36,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 185 flow [2023-08-29 20:38:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:38:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:38:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-29 20:38:36,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46485260770975056 [2023-08-29 20:38:36,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-29 20:38:36,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-29 20:38:36,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:36,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-29 20:38:36,515 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-29 20:38:36,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,517 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 85 flow. Second operand 3 states and 410 transitions. [2023-08-29 20:38:36,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 185 flow [2023-08-29 20:38:36,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:38:36,520 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2023-08-29 20:38:36,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-29 20:38:36,521 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 20:38:36,521 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2023-08-29 20:38:36,521 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-29 20:38:36,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:36,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:36,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-29 20:38:36,728 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-29 20:38:36,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:36,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2030740119, now seen corresponding path program 1 times [2023-08-29 20:38:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:36,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735144587] [2023-08-29 20:38:36,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:36,730 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-29 20:38:36,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:36,731 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-29 20:38:36,733 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-29 20:38:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:36,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:38:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:36,854 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-29 20:38:36,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:36,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735144587] [2023-08-29 20:38:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735144587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:36,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:36,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:36,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602642651] [2023-08-29 20:38:36,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:36,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:38:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:38:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:38:36,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 294 [2023-08-29 20:38:36,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:36,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 294 [2023-08-29 20:38:36,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:36,991 INFO L130 PetriNetUnfolder]: 147/317 cut-off events. [2023-08-29 20:38:36,991 INFO L131 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2023-08-29 20:38:36,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 317 events. 147/317 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1273 event pairs, 38 based on Foata normal form. 16/291 useless extension candidates. Maximal degree in co-relation 777. Up to 199 conditions per place. [2023-08-29 20:38:36,993 INFO L137 encePairwiseOnDemand]: 289/294 looper letters, 39 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-08-29 20:38:36,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 245 flow [2023-08-29 20:38:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-29 20:38:36,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461734693877551 [2023-08-29 20:38:36,994 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-29 20:38:36,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-29 20:38:36,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:36,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-29 20:38:36,996 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-29 20:38:36,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,998 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:36,998 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 543 transitions. [2023-08-29 20:38:36,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 245 flow [2023-08-29 20:38:36,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:38:37,000 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2023-08-29 20:38:37,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-29 20:38:37,000 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 20:38:37,001 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2023-08-29 20:38:37,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:37,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:37,015 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-29 20:38:37,213 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-29 20:38:37,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:37,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash -907053924, now seen corresponding path program 1 times [2023-08-29 20:38:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:37,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980688073] [2023-08-29 20:38:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:37,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:38:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:37,218 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-29 20:38:37,220 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-29 20:38:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:37,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:38:37,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:38:37,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:37,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:37,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980688073] [2023-08-29 20:38:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980688073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:37,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:37,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:38:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550273169] [2023-08-29 20:38:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:37,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:37,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 294 [2023-08-29 20:38:37,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:37,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 294 [2023-08-29 20:38:37,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:37,562 INFO L130 PetriNetUnfolder]: 68/155 cut-off events. [2023-08-29 20:38:37,562 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-29 20:38:37,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 155 events. 68/155 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 486 event pairs, 19 based on Foata normal form. 7/155 useless extension candidates. Maximal degree in co-relation 438. Up to 58 conditions per place. [2023-08-29 20:38:37,564 INFO L137 encePairwiseOnDemand]: 289/294 looper letters, 32 selfloop transitions, 10 changer transitions 1/48 dead transitions. [2023-08-29 20:38:37,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 247 flow [2023-08-29 20:38:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-29 20:38:37,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45170068027210886 [2023-08-29 20:38:37,571 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-29 20:38:37,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-29 20:38:37,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:37,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-29 20:38:37,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,577 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 664 transitions. [2023-08-29 20:38:37,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 247 flow [2023-08-29 20:38:37,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 231 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:37,579 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-08-29 20:38:37,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, 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-29 20:38:37,581 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 20:38:37,582 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-08-29 20:38:37,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:37,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:37,582 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-29 20:38:37,603 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-29 20:38:37,790 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-29 20:38:37,790 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:37,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash -467583352, now seen corresponding path program 1 times [2023-08-29 20:38:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003145799] [2023-08-29 20:38:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:37,792 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-29 20:38:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:37,793 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-29 20:38:37,795 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-29 20:38:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:37,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:38:37,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:38,386 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-29 20:38:38,394 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-29 20:38:38,417 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-29 20:38:38,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:38,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003145799] [2023-08-29 20:38:38,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003145799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:38,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:38,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868682539] [2023-08-29 20:38:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:38,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 294 [2023-08-29 20:38:38,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:38,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:38,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 294 [2023-08-29 20:38:38,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:38,578 INFO L130 PetriNetUnfolder]: 80/173 cut-off events. [2023-08-29 20:38:38,578 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2023-08-29 20:38:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 173 events. 80/173 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 599 event pairs, 45 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 505. Up to 119 conditions per place. [2023-08-29 20:38:38,579 INFO L137 encePairwiseOnDemand]: 290/294 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-08-29 20:38:38,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 265 flow [2023-08-29 20:38:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:38:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:38:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-29 20:38:38,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340136054421769 [2023-08-29 20:38:38,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-29 20:38:38,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-29 20:38:38,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:38,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-29 20:38:38,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:38,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:38,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:38,584 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 5 states and 638 transitions. [2023-08-29 20:38:38,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 265 flow [2023-08-29 20:38:38,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 233 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:38,585 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 115 flow [2023-08-29 20:38:38,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, 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-29 20:38:38,586 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 20:38:38,586 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 115 flow [2023-08-29 20:38:38,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:38,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:38,586 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-29 20:38:38,597 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-29 20:38:38,794 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-29 20:38:38,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:38,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash 909447285, now seen corresponding path program 1 times [2023-08-29 20:38:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68095655] [2023-08-29 20:38:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:38,795 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-29 20:38:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:38,798 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-29 20:38:38,804 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-29 20:38:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:38:38,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:38:38,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:38:39,220 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-29 20:38:39,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-29 20:38:39,306 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-29 20:38:39,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:38:39,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:38:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68095655] [2023-08-29 20:38:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68095655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:38:39,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:38:39,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:38:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304405480] [2023-08-29 20:38:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:38:39,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:38:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:38:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:38:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:38:39,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 294 [2023-08-29 20:38:39,387 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.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-29 20:38:39,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:38:39,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 294 [2023-08-29 20:38:39,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:38:39,474 INFO L130 PetriNetUnfolder]: 80/172 cut-off events. [2023-08-29 20:38:39,474 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-08-29 20:38:39,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 172 events. 80/172 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 591 event pairs, 45 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 488. Up to 121 conditions per place. [2023-08-29 20:38:39,475 INFO L137 encePairwiseOnDemand]: 291/294 looper letters, 37 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 20:38:39,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 235 flow [2023-08-29 20:38:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:38:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:38:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-29 20:38:39,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2023-08-29 20:38:39,476 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-29 20:38:39,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-29 20:38:39,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:38:39,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-29 20:38:39,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:39,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:39,479 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:38:39,479 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 115 flow. Second operand 4 states and 528 transitions. [2023-08-29 20:38:39,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 235 flow [2023-08-29 20:38:39,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:38:39,482 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-08-29 20:38:39,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, 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-29 20:38:39,484 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2023-08-29 20:38:39,484 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-08-29 20:38:39,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-29 20:38:39,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:38:39,485 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-29 20:38:39,504 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-29 20:38:39,693 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-29 20:38:39,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-08-29 20:38:39,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:38:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 909447587, now seen corresponding path program 1 times [2023-08-29 20:38:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:38:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336682347] [2023-08-29 20:38:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:38:39,697 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-29 20:38:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:38:39,698 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-29 20:38:39,700 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-29 20:38:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:39,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:38:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:38:39,958 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:38:39,958 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:38:39,959 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-08-29 20:38:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-08-29 20:38:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-08-29 20:38:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-08-29 20:38:39,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-08-29 20:38:39,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-08-29 20:38:39,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-08-29 20:38:39,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-08-29 20:38:39,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-08-29 20:38:39,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-08-29 20:38:39,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-08-29 20:38:39,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:38:40,175 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-29 20:38:40,175 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:38:40,180 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:38:40,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:38:40,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:38:40 BasicIcfg [2023-08-29 20:38:40,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:38:40,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:38:40,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:38:40,261 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:38:40,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:38:23" (3/4) ... [2023-08-29 20:38:40,263 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:38:40,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:38:40,263 INFO L158 Benchmark]: Toolchain (without parser) took 18512.45ms. Allocated memory was 83.9MB in the beginning and 297.8MB in the end (delta: 213.9MB). Free memory was 59.8MB in the beginning and 138.4MB in the end (delta: -78.6MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2023-08-29 20:38:40,263 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 38.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:40,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.49ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 55.7MB in the end (delta: 3.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:40,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.18ms. Allocated memory is still 83.9MB. Free memory was 55.7MB in the beginning and 53.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:40,264 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 83.9MB. Free memory was 53.2MB in the beginning and 51.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:40,264 INFO L158 Benchmark]: RCFGBuilder took 937.82ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 51.1MB in the beginning and 71.7MB in the end (delta: -20.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2023-08-29 20:38:40,264 INFO L158 Benchmark]: TraceAbstraction took 17190.56ms. Allocated memory was 113.2MB in the beginning and 297.8MB in the end (delta: 184.5MB). Free memory was 70.9MB in the beginning and 138.4MB in the end (delta: -67.5MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. [2023-08-29 20:38:40,264 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 297.8MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:38:40,266 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory is still 38.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.49ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 55.7MB in the end (delta: 3.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.18ms. Allocated memory is still 83.9MB. Free memory was 55.7MB in the beginning and 53.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 83.9MB. Free memory was 53.2MB in the beginning and 51.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 937.82ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 51.1MB in the beginning and 71.7MB in the end (delta: -20.7MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17190.56ms. Allocated memory was 113.2MB in the beginning and 297.8MB in the end (delta: 184.5MB). Free memory was 70.9MB in the beginning and 138.4MB in the end (delta: -67.5MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 297.8MB. Free memory is still 138.4MB. 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: 10.2s, 165 PlacesBefore, 67 PlacesAfterwards, 157 TransitionsBefore, 58 TransitionsAfterwards, 4408 CoEnabledTransitionPairs, 8 FixpointIterations, 66 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 134 TotalNumberOfCompositions, 18659 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7289, independent: 6835, independent conditional: 0, independent unconditional: 6835, dependent: 454, dependent conditional: 0, dependent unconditional: 454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2120, independent: 2050, independent conditional: 0, independent unconditional: 2050, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7289, independent: 4785, independent conditional: 0, independent unconditional: 4785, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 2120, unknown conditional: 0, unknown unconditional: 2120] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 346, Positive conditional cache size: 0, Positive unconditional cache size: 346, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1949, ((void *)0), P0, ((void *)0))=-1, t1949={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t1950; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L839] FCALL, FORK 0 pthread_create(&t1950, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1950, ((void *)0), P1, ((void *)0))=0, t1949={7:0}, t1950={14:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1951, ((void *)0), P2, ((void *)0))=1, t1949={7:0}, t1950={14:0}, t1951={15:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949={7:0}, t1950={14:0}, t1951={15:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L858] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: 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, 202 locations, 53 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: 17.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 287 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 774 IncrementalHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 5 mSDtfsCounter, 774 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=5, InterpolantAutomatonStates: 29, 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.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 430 SizeOfPredicates, 25 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-29 20:38:40,297 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