./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:19:21,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:19:21,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:19:21,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:19:21,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:19:21,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:19:21,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:19:21,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:19:21,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:19:21,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:19:21,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:19:21,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:19:21,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:19:21,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:19:21,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:19:21,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:19:21,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:19:21,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:19:21,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:19:21,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:19:21,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:19:21,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:19:21,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:19:21,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:19:21,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:19:21,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:19:21,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:19:21,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:19:21,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:19:21,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:19:21,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:19:21,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:19:21,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:19:21,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:19:21,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:19:21,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:19:21,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:19:21,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:19:21,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:19:21,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:19:21,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:19:21,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:19:21,450 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:19:21,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:19:21,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:19:21,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:19:21,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:19:21,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:19:21,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:19:21,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:19:21,453 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:19:21,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:19:21,454 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:19:21,454 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:19:21,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:19:21,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:19:21,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:19:21,455 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:19:21,455 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:19:21,455 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:19:21,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:19:21,455 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:19:21,456 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:19:21,456 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:19:21,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:19:21,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:19:21,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:19:21,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:19:21,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:19:21,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:19:21,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:19:21,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:19:21,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:19:21,457 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:19:21,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:19:21,458 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:19:21,458 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 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 -> TOGETHER [2023-08-30 03:19:21,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:19:21,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:19:21,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:19:21,723 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:19:21,723 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:19:21,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 03:19:22,652 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:19:22,857 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:19:22,857 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 03:19:22,865 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00105aea/a7673faf8ee24b8aab974a56d5b45a41/FLAGf88823db5 [2023-08-30 03:19:22,875 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c00105aea/a7673faf8ee24b8aab974a56d5b45a41 [2023-08-30 03:19:22,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:19:22,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:19:22,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:19:22,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:19:22,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:19:22,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:19:22" (1/1) ... [2023-08-30 03:19:22,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205bb323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:22, skipping insertion in model container [2023-08-30 03:19:22,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:19:22" (1/1) ... [2023-08-30 03:19:22,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:19:22,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:19:23,077 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-30 03:19:23,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:19:23,266 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:19:23,277 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-30 03:19:23,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:19:23,369 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:19:23,369 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:19:23,373 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:19:23,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23 WrapperNode [2023-08-30 03:19:23,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:19:23,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:19:23,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:19:23,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:19:23,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,436 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-30 03:19:23,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:19:23,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:19:23,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:19:23,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:19:23,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:19:23,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:19:23,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:19:23,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:19:23,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (1/1) ... [2023-08-30 03:19:23,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:19:23,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:19:23,503 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-30 03:19:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:19:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:19:23,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:19:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:19:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:19:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:19:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:19:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:19:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:19:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:19:23,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:19:23,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:19:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:19:23,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:19:23,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:19:23,535 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:19:23,522 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-30 03:19:23,670 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:19:23,671 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:19:23,972 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:19:24,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:19:24,056 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:19:24,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:19:24 BoogieIcfgContainer [2023-08-30 03:19:24,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:19:24,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:19:24,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:19:24,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:19:24,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:19:22" (1/3) ... [2023-08-30 03:19:24,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c787808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:19:24, skipping insertion in model container [2023-08-30 03:19:24,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:23" (2/3) ... [2023-08-30 03:19:24,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c787808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:19:24, skipping insertion in model container [2023-08-30 03:19:24,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:19:24" (3/3) ... [2023-08-30 03:19:24,063 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 03:19:24,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:19:24,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 03:19:24,074 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:19:24,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:19:24,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-08-30 03:19:24,193 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-30 03:19:24,194 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:24,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:19:24,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-08-30 03:19:24,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-08-30 03:19:24,204 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:19:24,212 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-30 03:19:24,217 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-30 03:19:24,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-08-30 03:19:24,234 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-30 03:19:24,236 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:24,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:19:24,238 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-30 03:19:27,468 INFO L134 LiptonReduction]: Checked pairs total: 5476 [2023-08-30 03:19:27,468 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-30 03:19:27,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:19:27,481 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;@9509459, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:19:27,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 03:19:27,483 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:19:27,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:27,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:27,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:19:27,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:27,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash 505, now seen corresponding path program 1 times [2023-08-30 03:19:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861726255] [2023-08-30 03:19:27,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:27,564 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-30 03:19:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861726255] [2023-08-30 03:19:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861726255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:19:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119218705] [2023-08-30 03:19:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:19:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:19:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:19:27,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 221 [2023-08-30 03:19:27,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:27,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:27,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 221 [2023-08-30 03:19:27,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:27,903 INFO L130 PetriNetUnfolder]: 1463/2209 cut-off events. [2023-08-30 03:19:27,903 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 03:19:27,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 2209 events. 1463/2209 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10892 event pairs, 1463 based on Foata normal form. 80/1891 useless extension candidates. Maximal degree in co-relation 4409. Up to 2155 conditions per place. [2023-08-30 03:19:27,916 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-30 03:19:27,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-30 03:19:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:19:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:19:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2023-08-30 03:19:27,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339366515837104 [2023-08-30 03:19:27,925 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions. [2023-08-30 03:19:27,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions. [2023-08-30 03:19:27,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:27,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions. [2023-08-30 03:19:27,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:27,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:27,932 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:27,933 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 236 transitions. [2023-08-30 03:19:27,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-30 03:19:27,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:19:27,936 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-30 03:19:27,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-30 03:19:27,939 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-30 03:19:27,939 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-30 03:19:27,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:27,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:27,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:19:27,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:19:27,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:27,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash 496101, now seen corresponding path program 1 times [2023-08-30 03:19:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:27,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026086941] [2023-08-30 03:19:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:28,126 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-30 03:19:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026086941] [2023-08-30 03:19:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026086941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:19:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448587852] [2023-08-30 03:19:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:28,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:19:28,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:19:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:19:28,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221 [2023-08-30 03:19:28,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:28,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:28,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221 [2023-08-30 03:19:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:28,288 INFO L130 PetriNetUnfolder]: 1143/1745 cut-off events. [2023-08-30 03:19:28,288 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:28,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 1745 events. 1143/1745 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8257 event pairs, 479 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 3483. Up to 1375 conditions per place. [2023-08-30 03:19:28,294 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-30 03:19:28,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2023-08-30 03:19:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:19:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:19:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-30 03:19:28,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521870286576169 [2023-08-30 03:19:28,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-30 03:19:28,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-30 03:19:28,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:28,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-30 03:19:28,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:28,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:28,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:28,300 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 346 transitions. [2023-08-30 03:19:28,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2023-08-30 03:19:28,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:19:28,301 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-30 03:19:28,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-30 03:19:28,302 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-30 03:19:28,302 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-30 03:19:28,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:28,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:28,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:28,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:19:28,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:28,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -317024778, now seen corresponding path program 1 times [2023-08-30 03:19:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237995161] [2023-08-30 03:19:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:28,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:29,040 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-30 03:19:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:29,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237995161] [2023-08-30 03:19:29,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237995161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:29,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:29,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273020513] [2023-08-30 03:19:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:29,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:29,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:29,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:29,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221 [2023-08-30 03:19:29,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:29,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:29,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221 [2023-08-30 03:19:29,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:29,509 INFO L130 PetriNetUnfolder]: 2162/3172 cut-off events. [2023-08-30 03:19:29,509 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2023-08-30 03:19:29,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3172 events. 2162/3172 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15369 event pairs, 231 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 6570. Up to 1718 conditions per place. [2023-08-30 03:19:29,520 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 60 selfloop transitions, 26 changer transitions 0/87 dead transitions. [2023-08-30 03:19:29,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 87 transitions, 374 flow [2023-08-30 03:19:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 712 transitions. [2023-08-30 03:19:29,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602456367162249 [2023-08-30 03:19:29,538 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 712 transitions. [2023-08-30 03:19:29,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 712 transitions. [2023-08-30 03:19:29,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:29,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 712 transitions. [2023-08-30 03:19:29,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:29,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:29,544 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:29,544 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 7 states and 712 transitions. [2023-08-30 03:19:29,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 87 transitions, 374 flow [2023-08-30 03:19:29,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:19:29,546 INFO L231 Difference]: Finished difference. Result has 42 places, 50 transitions, 252 flow [2023-08-30 03:19:29,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=42, PETRI_TRANSITIONS=50} [2023-08-30 03:19:29,547 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-30 03:19:29,550 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 50 transitions, 252 flow [2023-08-30 03:19:29,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:29,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:29,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:29,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:19:29,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:29,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash -317024704, now seen corresponding path program 1 times [2023-08-30 03:19:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767054807] [2023-08-30 03:19:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:29,840 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-30 03:19:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767054807] [2023-08-30 03:19:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767054807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:29,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216883135] [2023-08-30 03:19:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:29,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:29,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:29,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 221 [2023-08-30 03:19:29,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 50 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:29,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:29,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 221 [2023-08-30 03:19:29,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:30,242 INFO L130 PetriNetUnfolder]: 1508/2280 cut-off events. [2023-08-30 03:19:30,243 INFO L131 PetriNetUnfolder]: For 3525/3733 co-relation queries the response was YES. [2023-08-30 03:19:30,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 2280 events. 1508/2280 cut-off events. For 3525/3733 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11378 event pairs, 552 based on Foata normal form. 391/2645 useless extension candidates. Maximal degree in co-relation 7579. Up to 2061 conditions per place. [2023-08-30 03:19:30,253 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 41 selfloop transitions, 3 changer transitions 9/61 dead transitions. [2023-08-30 03:19:30,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 405 flow [2023-08-30 03:19:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:19:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:19:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-30 03:19:30,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4244343891402715 [2023-08-30 03:19:30,255 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-30 03:19:30,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-30 03:19:30,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:30,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-30 03:19:30,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:30,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:30,259 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:30,259 INFO L175 Difference]: Start difference. First operand has 42 places, 50 transitions, 252 flow. Second operand 5 states and 469 transitions. [2023-08-30 03:19:30,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 405 flow [2023-08-30 03:19:30,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:19:30,264 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 190 flow [2023-08-30 03:19:30,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-30 03:19:30,264 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-30 03:19:30,265 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 190 flow [2023-08-30 03:19:30,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:30,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:30,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:30,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:19:30,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:30,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1778325454, now seen corresponding path program 1 times [2023-08-30 03:19:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337826040] [2023-08-30 03:19:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:30,710 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-30 03:19:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:30,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337826040] [2023-08-30 03:19:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337826040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:30,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:30,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:30,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227105558] [2023-08-30 03:19:30,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:30,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:30,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:30,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:30,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221 [2023-08-30 03:19:30,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:30,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:30,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221 [2023-08-30 03:19:30,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:31,117 INFO L130 PetriNetUnfolder]: 1658/2645 cut-off events. [2023-08-30 03:19:31,117 INFO L131 PetriNetUnfolder]: For 3207/3225 co-relation queries the response was YES. [2023-08-30 03:19:31,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8726 conditions, 2645 events. 1658/2645 cut-off events. For 3207/3225 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13833 event pairs, 281 based on Foata normal form. 140/2785 useless extension candidates. Maximal degree in co-relation 8717. Up to 1618 conditions per place. [2023-08-30 03:19:31,129 INFO L137 encePairwiseOnDemand]: 209/221 looper letters, 42 selfloop transitions, 15 changer transitions 45/103 dead transitions. [2023-08-30 03:19:31,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 103 transitions, 711 flow [2023-08-30 03:19:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2023-08-30 03:19:31,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550743374272786 [2023-08-30 03:19:31,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2023-08-30 03:19:31,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2023-08-30 03:19:31,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:31,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2023-08-30 03:19:31,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,137 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,137 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 190 flow. Second operand 7 states and 704 transitions. [2023-08-30 03:19:31,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 103 transitions, 711 flow [2023-08-30 03:19:31,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 103 transitions, 704 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:19:31,144 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 299 flow [2023-08-30 03:19:31,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-30 03:19:31,146 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-30 03:19:31,146 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 299 flow [2023-08-30 03:19:31,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:31,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:31,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:19:31,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:31,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -708531811, now seen corresponding path program 1 times [2023-08-30 03:19:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435672795] [2023-08-30 03:19:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:31,336 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-30 03:19:31,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435672795] [2023-08-30 03:19:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435672795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:31,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021776644] [2023-08-30 03:19:31,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:31,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:19:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:31,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:19:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:19:31,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221 [2023-08-30 03:19:31,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:31,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221 [2023-08-30 03:19:31,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:31,659 INFO L130 PetriNetUnfolder]: 1862/2912 cut-off events. [2023-08-30 03:19:31,659 INFO L131 PetriNetUnfolder]: For 8482/8591 co-relation queries the response was YES. [2023-08-30 03:19:31,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11458 conditions, 2912 events. 1862/2912 cut-off events. For 8482/8591 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15860 event pairs, 480 based on Foata normal form. 191/3038 useless extension candidates. Maximal degree in co-relation 11444. Up to 1402 conditions per place. [2023-08-30 03:19:31,672 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 46 selfloop transitions, 6 changer transitions 23/81 dead transitions. [2023-08-30 03:19:31,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 692 flow [2023-08-30 03:19:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:19:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:19:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-30 03:19:31,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805429864253394 [2023-08-30 03:19:31,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-30 03:19:31,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-30 03:19:31,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:31,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-30 03:19:31,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,677 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 299 flow. Second operand 5 states and 531 transitions. [2023-08-30 03:19:31,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 692 flow [2023-08-30 03:19:31,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 674 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-30 03:19:31,691 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 313 flow [2023-08-30 03:19:31,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-30 03:19:31,692 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-30 03:19:31,692 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 313 flow [2023-08-30 03:19:31,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:31,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:31,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:31,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:19:31,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:31,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -707101843, now seen corresponding path program 1 times [2023-08-30 03:19:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280573813] [2023-08-30 03:19:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:32,328 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-30 03:19:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280573813] [2023-08-30 03:19:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280573813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:32,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061289197] [2023-08-30 03:19:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:32,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:32,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 221 [2023-08-30 03:19:32,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:32,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:32,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 221 [2023-08-30 03:19:32,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:32,900 INFO L130 PetriNetUnfolder]: 2585/3936 cut-off events. [2023-08-30 03:19:32,900 INFO L131 PetriNetUnfolder]: For 11690/11690 co-relation queries the response was YES. [2023-08-30 03:19:32,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15550 conditions, 3936 events. 2585/3936 cut-off events. For 11690/11690 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20211 event pairs, 628 based on Foata normal form. 180/4116 useless extension candidates. Maximal degree in co-relation 15533. Up to 2741 conditions per place. [2023-08-30 03:19:32,915 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 49 selfloop transitions, 26 changer transitions 35/110 dead transitions. [2023-08-30 03:19:32,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 110 transitions, 954 flow [2023-08-30 03:19:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2023-08-30 03:19:32,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45248868778280543 [2023-08-30 03:19:32,918 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2023-08-30 03:19:32,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2023-08-30 03:19:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:32,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2023-08-30 03:19:32,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:32,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:32,921 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:32,921 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 313 flow. Second operand 7 states and 700 transitions. [2023-08-30 03:19:32,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 110 transitions, 954 flow [2023-08-30 03:19:32,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 915 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-30 03:19:32,961 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 524 flow [2023-08-30 03:19:32,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-08-30 03:19:32,962 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-30 03:19:32,962 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 524 flow [2023-08-30 03:19:32,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:32,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:32,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:32,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:19:32,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:32,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:32,963 INFO L85 PathProgramCache]: Analyzing trace with hash -199130405, now seen corresponding path program 1 times [2023-08-30 03:19:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:32,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494743091] [2023-08-30 03:19:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:33,440 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-30 03:19:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494743091] [2023-08-30 03:19:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494743091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:19:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141212861] [2023-08-30 03:19:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:33,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:33,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221 [2023-08-30 03:19:33,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:33,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:33,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221 [2023-08-30 03:19:33,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:34,002 INFO L130 PetriNetUnfolder]: 3017/4772 cut-off events. [2023-08-30 03:19:34,002 INFO L131 PetriNetUnfolder]: For 22207/22331 co-relation queries the response was YES. [2023-08-30 03:19:34,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22987 conditions, 4772 events. 3017/4772 cut-off events. For 22207/22331 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27811 event pairs, 708 based on Foata normal form. 224/4954 useless extension candidates. Maximal degree in co-relation 22970. Up to 2128 conditions per place. [2023-08-30 03:19:34,026 INFO L137 encePairwiseOnDemand]: 209/221 looper letters, 56 selfloop transitions, 25 changer transitions 29/112 dead transitions. [2023-08-30 03:19:34,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 1195 flow [2023-08-30 03:19:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2023-08-30 03:19:34,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45248868778280543 [2023-08-30 03:19:34,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2023-08-30 03:19:34,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2023-08-30 03:19:34,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:34,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2023-08-30 03:19:34,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:34,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:34,032 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:34,032 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 524 flow. Second operand 7 states and 700 transitions. [2023-08-30 03:19:34,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 1195 flow [2023-08-30 03:19:34,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 1189 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 03:19:34,099 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 739 flow [2023-08-30 03:19:34,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=739, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-08-30 03:19:34,099 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-30 03:19:34,099 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 739 flow [2023-08-30 03:19:34,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:34,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:34,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:34,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:19:34,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:34,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash -135060535, now seen corresponding path program 1 times [2023-08-30 03:19:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709647355] [2023-08-30 03:19:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:34,661 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-30 03:19:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709647355] [2023-08-30 03:19:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709647355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:19:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618313626] [2023-08-30 03:19:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:19:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:19:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:19:34,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-30 03:19:34,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:34,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:34,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-30 03:19:34,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:35,369 INFO L130 PetriNetUnfolder]: 2977/4688 cut-off events. [2023-08-30 03:19:35,370 INFO L131 PetriNetUnfolder]: For 37304/38231 co-relation queries the response was YES. [2023-08-30 03:19:35,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25031 conditions, 4688 events. 2977/4688 cut-off events. For 37304/38231 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27350 event pairs, 950 based on Foata normal form. 779/5424 useless extension candidates. Maximal degree in co-relation 25009. Up to 3655 conditions per place. [2023-08-30 03:19:35,392 INFO L137 encePairwiseOnDemand]: 211/221 looper letters, 70 selfloop transitions, 27 changer transitions 38/144 dead transitions. [2023-08-30 03:19:35,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 144 transitions, 1922 flow [2023-08-30 03:19:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:19:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:19:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 816 transitions. [2023-08-30 03:19:35,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-30 03:19:35,395 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 816 transitions. [2023-08-30 03:19:35,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 816 transitions. [2023-08-30 03:19:35,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:35,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 816 transitions. [2023-08-30 03:19:35,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:35,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:35,399 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:35,399 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 739 flow. Second operand 8 states and 816 transitions. [2023-08-30 03:19:35,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 144 transitions, 1922 flow [2023-08-30 03:19:35,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 144 transitions, 1920 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 03:19:35,424 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 1107 flow [2023-08-30 03:19:35,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1107, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-08-30 03:19:35,425 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2023-08-30 03:19:35,425 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 1107 flow [2023-08-30 03:19:35,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:35,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:35,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:35,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:19:35,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:35,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -447158153, now seen corresponding path program 1 times [2023-08-30 03:19:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48113272] [2023-08-30 03:19:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:35,670 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-30 03:19:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48113272] [2023-08-30 03:19:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48113272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:19:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051776635] [2023-08-30 03:19:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:35,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:19:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:19:35,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:19:35,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221 [2023-08-30 03:19:35,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 1107 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:35,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:35,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221 [2023-08-30 03:19:35,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:36,216 INFO L130 PetriNetUnfolder]: 2697/4251 cut-off events. [2023-08-30 03:19:36,216 INFO L131 PetriNetUnfolder]: For 51265/51900 co-relation queries the response was YES. [2023-08-30 03:19:36,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27584 conditions, 4251 events. 2697/4251 cut-off events. For 51265/51900 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 24228 event pairs, 995 based on Foata normal form. 450/4660 useless extension candidates. Maximal degree in co-relation 27557. Up to 3477 conditions per place. [2023-08-30 03:19:36,241 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 80 selfloop transitions, 8 changer transitions 22/119 dead transitions. [2023-08-30 03:19:36,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1820 flow [2023-08-30 03:19:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:19:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:19:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2023-08-30 03:19:36,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47888386123680243 [2023-08-30 03:19:36,243 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 635 transitions. [2023-08-30 03:19:36,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions. [2023-08-30 03:19:36,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:36,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions. [2023-08-30 03:19:36,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:36,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:36,247 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:36,247 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 1107 flow. Second operand 6 states and 635 transitions. [2023-08-30 03:19:36,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1820 flow [2023-08-30 03:19:36,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1797 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-30 03:19:36,289 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 1110 flow [2023-08-30 03:19:36,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1110, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-08-30 03:19:36,290 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-30 03:19:36,290 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 1110 flow [2023-08-30 03:19:36,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:36,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:36,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:36,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:19:36,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:36,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash 106253211, now seen corresponding path program 1 times [2023-08-30 03:19:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967024719] [2023-08-30 03:19:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:36,869 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-30 03:19:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967024719] [2023-08-30 03:19:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967024719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:36,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:36,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:19:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802048362] [2023-08-30 03:19:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:36,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:19:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:36,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:19:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:19:36,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 221 [2023-08-30 03:19:36,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 1110 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:36,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:36,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 221 [2023-08-30 03:19:36,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:37,897 INFO L130 PetriNetUnfolder]: 3753/5831 cut-off events. [2023-08-30 03:19:37,897 INFO L131 PetriNetUnfolder]: For 65376/65376 co-relation queries the response was YES. [2023-08-30 03:19:37,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38356 conditions, 5831 events. 3753/5831 cut-off events. For 65376/65376 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 33402 event pairs, 736 based on Foata normal form. 197/6028 useless extension candidates. Maximal degree in co-relation 38326. Up to 3620 conditions per place. [2023-08-30 03:19:37,973 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 79 selfloop transitions, 61 changer transitions 53/193 dead transitions. [2023-08-30 03:19:37,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 193 transitions, 2978 flow [2023-08-30 03:19:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:19:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:19:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2023-08-30 03:19:37,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2023-08-30 03:19:37,976 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2023-08-30 03:19:37,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2023-08-30 03:19:37,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:37,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2023-08-30 03:19:37,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 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-30 03:19:37,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:37,980 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:37,981 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 1110 flow. Second operand 10 states and 962 transitions. [2023-08-30 03:19:37,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 193 transitions, 2978 flow [2023-08-30 03:19:38,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 193 transitions, 2944 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-30 03:19:38,051 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1766 flow [2023-08-30 03:19:38,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1766, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2023-08-30 03:19:38,052 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-08-30 03:19:38,052 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1766 flow [2023-08-30 03:19:38,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:38,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:38,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:38,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:19:38,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:38,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1104451855, now seen corresponding path program 2 times [2023-08-30 03:19:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:38,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638749477] [2023-08-30 03:19:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:38,467 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-30 03:19:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:38,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638749477] [2023-08-30 03:19:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638749477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:38,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:38,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:19:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446572380] [2023-08-30 03:19:38,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:38,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:19:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:19:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:19:38,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 221 [2023-08-30 03:19:38,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1766 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:38,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:38,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 221 [2023-08-30 03:19:38,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:39,503 INFO L130 PetriNetUnfolder]: 3673/5743 cut-off events. [2023-08-30 03:19:39,504 INFO L131 PetriNetUnfolder]: For 90217/90217 co-relation queries the response was YES. [2023-08-30 03:19:39,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43674 conditions, 5743 events. 3673/5743 cut-off events. For 90217/90217 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 33187 event pairs, 1079 based on Foata normal form. 158/5901 useless extension candidates. Maximal degree in co-relation 43639. Up to 3997 conditions per place. [2023-08-30 03:19:39,534 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 71 selfloop transitions, 83 changer transitions 58/212 dead transitions. [2023-08-30 03:19:39,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 212 transitions, 3911 flow [2023-08-30 03:19:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:19:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:19:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 949 transitions. [2023-08-30 03:19:39,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4294117647058823 [2023-08-30 03:19:39,537 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 949 transitions. [2023-08-30 03:19:39,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 949 transitions. [2023-08-30 03:19:39,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:39,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 949 transitions. [2023-08-30 03:19:39,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.9) internal successors, (949), 10 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:39,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:39,542 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:39,542 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1766 flow. Second operand 10 states and 949 transitions. [2023-08-30 03:19:39,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 212 transitions, 3911 flow [2023-08-30 03:19:39,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 212 transitions, 3832 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-30 03:19:39,641 INFO L231 Difference]: Finished difference. Result has 97 places, 130 transitions, 2549 flow [2023-08-30 03:19:39,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2549, PETRI_PLACES=97, PETRI_TRANSITIONS=130} [2023-08-30 03:19:39,642 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2023-08-30 03:19:39,642 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 130 transitions, 2549 flow [2023-08-30 03:19:39,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:39,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:39,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:39,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:19:39,643 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:39,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1104192385, now seen corresponding path program 3 times [2023-08-30 03:19:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:39,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317329219] [2023-08-30 03:19:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:40,238 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-30 03:19:40,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:40,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317329219] [2023-08-30 03:19:40,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317329219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:40,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:19:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756253259] [2023-08-30 03:19:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:40,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:19:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:19:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:19:40,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 221 [2023-08-30 03:19:40,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 130 transitions, 2549 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:40,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:40,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 221 [2023-08-30 03:19:40,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:41,049 INFO L130 PetriNetUnfolder]: 3309/5238 cut-off events. [2023-08-30 03:19:41,049 INFO L131 PetriNetUnfolder]: For 100892/100892 co-relation queries the response was YES. [2023-08-30 03:19:41,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43320 conditions, 5238 events. 3309/5238 cut-off events. For 100892/100892 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 30301 event pairs, 985 based on Foata normal form. 158/5396 useless extension candidates. Maximal degree in co-relation 43280. Up to 3422 conditions per place. [2023-08-30 03:19:41,083 INFO L137 encePairwiseOnDemand]: 210/221 looper letters, 77 selfloop transitions, 84 changer transitions 44/205 dead transitions. [2023-08-30 03:19:41,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 205 transitions, 4308 flow [2023-08-30 03:19:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:19:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:19:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 767 transitions. [2023-08-30 03:19:41,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-08-30 03:19:41,101 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 767 transitions. [2023-08-30 03:19:41,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 767 transitions. [2023-08-30 03:19:41,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:41,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 767 transitions. [2023-08-30 03:19:41,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,105 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,105 INFO L175 Difference]: Start difference. First operand has 97 places, 130 transitions, 2549 flow. Second operand 8 states and 767 transitions. [2023-08-30 03:19:41,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 205 transitions, 4308 flow [2023-08-30 03:19:41,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 205 transitions, 4099 flow, removed 104 selfloop flow, removed 5 redundant places. [2023-08-30 03:19:41,341 INFO L231 Difference]: Finished difference. Result has 102 places, 143 transitions, 3028 flow [2023-08-30 03:19:41,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3028, PETRI_PLACES=102, PETRI_TRANSITIONS=143} [2023-08-30 03:19:41,342 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2023-08-30 03:19:41,342 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 143 transitions, 3028 flow [2023-08-30 03:19:41,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:41,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:41,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:19:41,343 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:41,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1287512872, now seen corresponding path program 1 times [2023-08-30 03:19:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134596309] [2023-08-30 03:19:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:41,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:41,472 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-30 03:19:41,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:41,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134596309] [2023-08-30 03:19:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134596309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:41,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704330801] [2023-08-30 03:19:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:41,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:19:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:19:41,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:19:41,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-30 03:19:41,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 143 transitions, 3028 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:41,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-30 03:19:41,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:41,968 INFO L130 PetriNetUnfolder]: 1855/3126 cut-off events. [2023-08-30 03:19:41,968 INFO L131 PetriNetUnfolder]: For 93058/94617 co-relation queries the response was YES. [2023-08-30 03:19:41,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27771 conditions, 3126 events. 1855/3126 cut-off events. For 93058/94617 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 19243 event pairs, 264 based on Foata normal form. 1307/4401 useless extension candidates. Maximal degree in co-relation 27729. Up to 1853 conditions per place. [2023-08-30 03:19:41,986 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 118 selfloop transitions, 5 changer transitions 112/253 dead transitions. [2023-08-30 03:19:41,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 253 transitions, 5908 flow [2023-08-30 03:19:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:19:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:19:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-30 03:19:41,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47782805429864256 [2023-08-30 03:19:41,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-30 03:19:41,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-30 03:19:41,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:41,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-30 03:19:41,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 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-30 03:19:41,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,991 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:41,991 INFO L175 Difference]: Start difference. First operand has 102 places, 143 transitions, 3028 flow. Second operand 5 states and 528 transitions. [2023-08-30 03:19:41,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 253 transitions, 5908 flow [2023-08-30 03:19:42,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 253 transitions, 5697 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-30 03:19:42,067 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 2230 flow [2023-08-30 03:19:42,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2230, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2023-08-30 03:19:42,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2023-08-30 03:19:42,068 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 2230 flow [2023-08-30 03:19:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:42,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:42,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:19:42,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:42,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1681267990, now seen corresponding path program 1 times [2023-08-30 03:19:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480534235] [2023-08-30 03:19:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:42,195 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-30 03:19:42,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:42,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480534235] [2023-08-30 03:19:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480534235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:19:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237076896] [2023-08-30 03:19:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:42,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:42,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:42,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:42,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-30 03:19:42,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 2230 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:42,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-30 03:19:42,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:42,498 INFO L130 PetriNetUnfolder]: 1059/1851 cut-off events. [2023-08-30 03:19:42,499 INFO L131 PetriNetUnfolder]: For 48077/48773 co-relation queries the response was YES. [2023-08-30 03:19:42,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16960 conditions, 1851 events. 1059/1851 cut-off events. For 48077/48773 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10736 event pairs, 57 based on Foata normal form. 638/2479 useless extension candidates. Maximal degree in co-relation 16920. Up to 801 conditions per place. [2023-08-30 03:19:42,508 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 102 selfloop transitions, 8 changer transitions 142/265 dead transitions. [2023-08-30 03:19:42,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 265 transitions, 6028 flow [2023-08-30 03:19:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2023-08-30 03:19:42,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47575953458306397 [2023-08-30 03:19:42,511 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 736 transitions. [2023-08-30 03:19:42,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 736 transitions. [2023-08-30 03:19:42,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:42,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 736 transitions. [2023-08-30 03:19:42,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 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-30 03:19:42,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,514 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 2230 flow. Second operand 7 states and 736 transitions. [2023-08-30 03:19:42,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 265 transitions, 6028 flow [2023-08-30 03:19:42,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 265 transitions, 5886 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-30 03:19:42,565 INFO L231 Difference]: Finished difference. Result has 105 places, 85 transitions, 1581 flow [2023-08-30 03:19:42,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1581, PETRI_PLACES=105, PETRI_TRANSITIONS=85} [2023-08-30 03:19:42,565 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2023-08-30 03:19:42,565 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 1581 flow [2023-08-30 03:19:42,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:42,566 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-30 03:19:42,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:19:42,566 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:42,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:42,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1274552174, now seen corresponding path program 1 times [2023-08-30 03:19:42,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9042924] [2023-08-30 03:19:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:19:42,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:42,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9042924] [2023-08-30 03:19:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9042924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:42,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:19:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383419240] [2023-08-30 03:19:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:42,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:19:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:19:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:19:42,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-30 03:19:42,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 1581 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:42,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-30 03:19:42,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:42,938 INFO L130 PetriNetUnfolder]: 634/1168 cut-off events. [2023-08-30 03:19:42,938 INFO L131 PetriNetUnfolder]: For 22427/22602 co-relation queries the response was YES. [2023-08-30 03:19:42,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10784 conditions, 1168 events. 634/1168 cut-off events. For 22427/22602 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6515 event pairs, 45 based on Foata normal form. 150/1309 useless extension candidates. Maximal degree in co-relation 10742. Up to 484 conditions per place. [2023-08-30 03:19:42,943 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 50 selfloop transitions, 10 changer transitions 119/183 dead transitions. [2023-08-30 03:19:42,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 183 transitions, 3848 flow [2023-08-30 03:19:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:19:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:19:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 822 transitions. [2023-08-30 03:19:42,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649321266968326 [2023-08-30 03:19:42,946 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 822 transitions. [2023-08-30 03:19:42,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 822 transitions. [2023-08-30 03:19:42,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:42,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 822 transitions. [2023-08-30 03:19:42,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.75) internal successors, (822), 8 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,950 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,950 INFO L175 Difference]: Start difference. First operand has 105 places, 85 transitions, 1581 flow. Second operand 8 states and 822 transitions. [2023-08-30 03:19:42,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 183 transitions, 3848 flow [2023-08-30 03:19:42,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 183 transitions, 3513 flow, removed 89 selfloop flow, removed 10 redundant places. [2023-08-30 03:19:42,981 INFO L231 Difference]: Finished difference. Result has 103 places, 43 transitions, 621 flow [2023-08-30 03:19:42,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=621, PETRI_PLACES=103, PETRI_TRANSITIONS=43} [2023-08-30 03:19:42,981 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2023-08-30 03:19:42,981 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 43 transitions, 621 flow [2023-08-30 03:19:42,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:42,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:42,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:42,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:19:42,982 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:42,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1999981732, now seen corresponding path program 1 times [2023-08-30 03:19:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4798985] [2023-08-30 03:19:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:43,585 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-30 03:19:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4798985] [2023-08-30 03:19:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4798985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 03:19:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649948594] [2023-08-30 03:19:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:43,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 03:19:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 03:19:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-30 03:19:43,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 221 [2023-08-30 03:19:43,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 43 transitions, 621 flow. Second operand has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:43,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:43,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 221 [2023-08-30 03:19:43,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:43,826 INFO L130 PetriNetUnfolder]: 126/257 cut-off events. [2023-08-30 03:19:43,826 INFO L131 PetriNetUnfolder]: For 3062/3062 co-relation queries the response was YES. [2023-08-30 03:19:43,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 257 events. 126/257 cut-off events. For 3062/3062 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 826 event pairs, 39 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 1990. Up to 160 conditions per place. [2023-08-30 03:19:43,828 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 48 selfloop transitions, 11 changer transitions 9/70 dead transitions. [2023-08-30 03:19:43,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 70 transitions, 1055 flow [2023-08-30 03:19:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:19:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:19:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2023-08-30 03:19:43,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464555052790347 [2023-08-30 03:19:43,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2023-08-30 03:19:43,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2023-08-30 03:19:43,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:43,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2023-08-30 03:19:43,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:43,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:43,831 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:43,831 INFO L175 Difference]: Start difference. First operand has 103 places, 43 transitions, 621 flow. Second operand 6 states and 592 transitions. [2023-08-30 03:19:43,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 70 transitions, 1055 flow [2023-08-30 03:19:43,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 691 flow, removed 76 selfloop flow, removed 33 redundant places. [2023-08-30 03:19:43,837 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 422 flow [2023-08-30 03:19:43,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2023-08-30 03:19:43,838 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-30 03:19:43,838 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 422 flow [2023-08-30 03:19:43,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:43,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:43,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:43,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:19:43,839 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:43,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1514924334, now seen corresponding path program 2 times [2023-08-30 03:19:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099097911] [2023-08-30 03:19:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:44,646 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-30 03:19:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:19:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099097911] [2023-08-30 03:19:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099097911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 03:19:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686646561] [2023-08-30 03:19:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 03:19:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:19:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 03:19:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 03:19:44,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-30 03:19:44,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:44,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:44,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-30 03:19:44,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:44,904 INFO L130 PetriNetUnfolder]: 128/273 cut-off events. [2023-08-30 03:19:44,904 INFO L131 PetriNetUnfolder]: For 1626/1626 co-relation queries the response was YES. [2023-08-30 03:19:44,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 273 events. 128/273 cut-off events. For 1626/1626 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 933 event pairs, 13 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 1544. Up to 142 conditions per place. [2023-08-30 03:19:44,906 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 40 selfloop transitions, 5 changer transitions 27/74 dead transitions. [2023-08-30 03:19:44,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 761 flow [2023-08-30 03:19:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 695 transitions. [2023-08-30 03:19:44,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449256625727214 [2023-08-30 03:19:44,908 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 695 transitions. [2023-08-30 03:19:44,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 695 transitions. [2023-08-30 03:19:44,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:44,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 695 transitions. [2023-08-30 03:19:44,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:44,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:44,921 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:44,921 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 422 flow. Second operand 7 states and 695 transitions. [2023-08-30 03:19:44,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 761 flow [2023-08-30 03:19:44,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 711 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-30 03:19:44,925 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 309 flow [2023-08-30 03:19:44,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=72, PETRI_TRANSITIONS=37} [2023-08-30 03:19:44,925 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-08-30 03:19:44,925 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 309 flow [2023-08-30 03:19:44,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:44,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:44,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:44,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:19:44,926 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:44,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2048187942, now seen corresponding path program 3 times [2023-08-30 03:19:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:19:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86361964] [2023-08-30 03:19:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:19:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:19:44,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:19:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:19:45,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:19:45,022 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:19:45,023 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 03:19:45,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 03:19:45,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 03:19:45,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 03:19:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 03:19:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 03:19:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 03:19:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 03:19:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 03:19:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 03:19:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 03:19:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 03:19:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 03:19:45,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:19:45,028 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:45,032 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:19:45,033 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:19:45,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:19:45 BasicIcfg [2023-08-30 03:19:45,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:19:45,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:19:45,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:19:45,081 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:19:45,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:19:24" (3/4) ... [2023-08-30 03:19:45,083 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:19:45,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:19:45,083 INFO L158 Benchmark]: Toolchain (without parser) took 22205.67ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 61.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 289.3MB. Max. memory is 16.1GB. [2023-08-30 03:19:45,084 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 42.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:19:45,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.07ms. Allocated memory is still 88.1MB. Free memory was 61.1MB in the beginning and 58.4MB in the end (delta: 2.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 03:19:45,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.75ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 55.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:19:45,084 INFO L158 Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 88.1MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:19:45,084 INFO L158 Benchmark]: RCFGBuilder took 576.86ms. Allocated memory is still 88.1MB. Free memory was 53.7MB in the beginning and 48.5MB in the end (delta: 5.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 03:19:45,085 INFO L158 Benchmark]: TraceAbstraction took 21020.93ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 47.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 274.9MB. Max. memory is 16.1GB. [2023-08-30 03:19:45,085 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:19:45,086 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 65.0MB. Free memory was 42.3MB in the beginning and 42.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.07ms. Allocated memory is still 88.1MB. Free memory was 61.1MB in the beginning and 58.4MB in the end (delta: 2.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.75ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 55.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.48ms. Allocated memory is still 88.1MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.86ms. Allocated memory is still 88.1MB. Free memory was 53.7MB in the beginning and 48.5MB in the end (delta: 5.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21020.93ms. Allocated memory was 88.1MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 47.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 274.9MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. 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: 3.3s, 121 PlacesBefore, 42 PlacesAfterwards, 113 TransitionsBefore, 33 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 5476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2477, independent: 2315, independent conditional: 0, independent unconditional: 2315, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1107, independent: 1075, independent conditional: 0, independent unconditional: 1075, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2477, independent: 1240, independent conditional: 0, independent unconditional: 1240, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1107, unknown conditional: 0, unknown unconditional: 1107] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=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=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=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=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=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=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 817]: 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: 819]: 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, 143 locations, 13 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: 20.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 974 mSDsluCounter, 949 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 765 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2773 IncrementalHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 184 mSDtfsCounter, 2773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3028occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-30 03:19:45,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:19:46,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:19:46,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:19:46,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:19:46,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:19:46,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:19:46,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:19:46,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:19:46,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:19:46,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:19:46,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:19:46,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:19:46,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:19:46,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:19:46,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:19:46,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:19:46,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:19:46,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:19:46,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:19:46,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:19:46,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:19:46,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:19:46,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:19:46,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:19:46,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:19:46,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:19:46,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:19:46,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:19:46,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:19:46,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:19:46,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:19:46,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:19:46,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:19:46,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:19:46,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:19:46,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:19:46,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:19:46,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:19:46,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:19:46,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:19:46,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:19:46,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:19:46,809 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:19:46,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:19:46,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:19:46,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:19:46,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:19:46,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:19:46,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:19:46,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:19:46,811 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:19:46,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:19:46,812 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:19:46,812 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:19:46,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:19:46,814 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:19:46,814 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:19:46,814 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:19:46,814 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:19:46,814 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:19:46,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:19:46,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:19:46,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:19:46,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:19:46,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:19:46,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:19:46,815 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:19:46,815 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:19:46,816 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:19:46,816 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:19:46,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:19:46,816 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:19:46,816 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:19:46,816 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 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 -> TOGETHER [2023-08-30 03:19:47,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:19:47,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:19:47,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:19:47,070 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:19:47,070 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:19:47,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 03:19:48,121 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:19:48,338 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:19:48,339 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 03:19:48,354 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c649132cd/91f551146fc147ed9de448675bae762e/FLAGc82b8a4bd [2023-08-30 03:19:48,363 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c649132cd/91f551146fc147ed9de448675bae762e [2023-08-30 03:19:48,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:19:48,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:19:48,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:19:48,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:19:48,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:19:48,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a6a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48, skipping insertion in model container [2023-08-30 03:19:48,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:19:48,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:19:48,509 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-30 03:19:48,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:19:48,693 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:19:48,708 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-30 03:19:48,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:19:48,758 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:19:48,759 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:19:48,772 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:19:48,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48 WrapperNode [2023-08-30 03:19:48,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:19:48,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:19:48,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:19:48,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:19:48,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,836 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 03:19:48,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:19:48,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:19:48,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:19:48,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:19:48,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,871 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:19:48,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:19:48,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:19:48,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:19:48,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (1/1) ... [2023-08-30 03:19:48,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:19:48,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:19:48,906 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-30 03:19:48,929 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-30 03:19:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:19:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:19:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:19:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:19:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:19:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:19:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:19:48,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:19:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:19:48,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:19:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:19:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:19:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:19:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:19:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:19:48,941 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:19:49,075 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:19:49,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:19:49,390 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:19:49,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:19:49,503 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:19:49,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:19:49 BoogieIcfgContainer [2023-08-30 03:19:49,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:19:49,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:19:49,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:19:49,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:19:49,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:19:48" (1/3) ... [2023-08-30 03:19:49,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad75269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:19:49, skipping insertion in model container [2023-08-30 03:19:49,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:19:48" (2/3) ... [2023-08-30 03:19:49,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad75269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:19:49, skipping insertion in model container [2023-08-30 03:19:49,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:19:49" (3/3) ... [2023-08-30 03:19:49,510 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 03:19:49,521 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:19:49,521 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-30 03:19:49,522 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:19:49,564 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:19:49,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-30 03:19:49,637 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-30 03:19:49,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:49,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:19:49,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-30 03:19:49,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-30 03:19:49,647 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:19:49,661 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-30 03:19:49,665 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-30 03:19:49,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-30 03:19:49,688 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-30 03:19:49,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:49,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-30 03:19:49,704 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-30 03:19:54,642 INFO L134 LiptonReduction]: Checked pairs total: 5468 [2023-08-30 03:19:54,642 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 03:19:54,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:19:54,662 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;@47293269, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:19:54,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-30 03:19:54,664 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:19:54,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:54,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:54,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:19:54,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:54,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 515, now seen corresponding path program 1 times [2023-08-30 03:19:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856345035] [2023-08-30 03:19:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:54,678 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-30 03:19:54,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:54,681 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-30 03:19:54,689 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-30 03:19:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:54,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:19:54,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:54,736 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-30 03:19:54,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:54,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856345035] [2023-08-30 03:19:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856345035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:19:54,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481091822] [2023-08-30 03:19:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:54,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:19:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:19:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:19:54,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 229 [2023-08-30 03:19:54,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:54,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:54,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 229 [2023-08-30 03:19:54,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:55,076 INFO L130 PetriNetUnfolder]: 1463/2208 cut-off events. [2023-08-30 03:19:55,076 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-30 03:19:55,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 2208 events. 1463/2208 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10851 event pairs, 1463 based on Foata normal form. 80/1888 useless extension candidates. Maximal degree in co-relation 4408. Up to 2155 conditions per place. [2023-08-30 03:19:55,089 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-30 03:19:55,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-30 03:19:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:19:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:19:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-08-30 03:19:55,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519650655021834 [2023-08-30 03:19:55,100 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-08-30 03:19:55,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-08-30 03:19:55,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:55,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-08-30 03:19:55,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,107 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,108 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 238 transitions. [2023-08-30 03:19:55,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-30 03:19:55,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:19:55,111 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-30 03:19:55,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-30 03:19:55,114 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-30 03:19:55,114 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-30 03:19:55,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:55,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 03:19:55,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 03:19:55,320 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-30 03:19:55,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:55,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 505775, now seen corresponding path program 1 times [2023-08-30 03:19:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455331523] [2023-08-30 03:19:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:55,322 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-30 03:19:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:55,323 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-30 03:19:55,325 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-30 03:19:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:55,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:19:55,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:55,401 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-30 03:19:55,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:55,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455331523] [2023-08-30 03:19:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455331523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:55,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:19:55,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303681570] [2023-08-30 03:19:55,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:55,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:19:55,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:19:55,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:19:55,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2023-08-30 03:19:55,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:55,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2023-08-30 03:19:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:55,592 INFO L130 PetriNetUnfolder]: 1143/1845 cut-off events. [2023-08-30 03:19:55,592 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:19:55,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 1845 events. 1143/1845 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10369 event pairs, 183 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 3583. Up to 1375 conditions per place. [2023-08-30 03:19:55,599 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-30 03:19:55,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2023-08-30 03:19:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:19:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:19:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-30 03:19:55,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080058224163028 [2023-08-30 03:19:55,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-30 03:19:55,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-30 03:19:55,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:55,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-30 03:19:55,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,610 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 349 transitions. [2023-08-30 03:19:55,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2023-08-30 03:19:55,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:19:55,611 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-30 03:19:55,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-30 03:19:55,612 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-30 03:19:55,612 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-30 03:19:55,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:55,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:55,621 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-30 03:19:55,820 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-30 03:19:55,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:55,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2024101978, now seen corresponding path program 1 times [2023-08-30 03:19:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893308180] [2023-08-30 03:19:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:55,824 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-30 03:19:55,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:55,825 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-30 03:19:55,827 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-30 03:19:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:55,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:19:55,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:55,936 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-30 03:19:55,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:55,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893308180] [2023-08-30 03:19:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893308180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:55,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:55,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222255792] [2023-08-30 03:19:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:19:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:55,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:19:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:19:55,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-30 03:19:55,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:55,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:55,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-30 03:19:55,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:56,107 INFO L130 PetriNetUnfolder]: 557/928 cut-off events. [2023-08-30 03:19:56,107 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-30 03:19:56,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 928 events. 557/928 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4414 event pairs, 113 based on Foata normal form. 64/951 useless extension candidates. Maximal degree in co-relation 1959. Up to 633 conditions per place. [2023-08-30 03:19:56,110 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2023-08-30 03:19:56,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow [2023-08-30 03:19:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:19:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:19:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-30 03:19:56,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663755458515284 [2023-08-30 03:19:56,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-30 03:19:56,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-30 03:19:56,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:56,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-30 03:19:56,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 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-30 03:19:56,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,116 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 5 states and 534 transitions. [2023-08-30 03:19:56,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow [2023-08-30 03:19:56,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:19:56,118 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-30 03:19:56,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-30 03:19:56,118 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2023-08-30 03:19:56,118 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-30 03:19:56,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:56,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:56,129 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-30 03:19:56,329 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-30 03:19:56,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:56,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 554545124, now seen corresponding path program 1 times [2023-08-30 03:19:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328149573] [2023-08-30 03:19:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:56,331 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-30 03:19:56,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:56,333 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-30 03:19:56,335 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-30 03:19:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:56,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:19:56,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:19:56,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:56,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:56,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328149573] [2023-08-30 03:19:56,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328149573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:56,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:19:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317380319] [2023-08-30 03:19:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:56,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:56,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-30 03:19:56,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:56,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-30 03:19:56,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:56,639 INFO L130 PetriNetUnfolder]: 233/441 cut-off events. [2023-08-30 03:19:56,639 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-08-30 03:19:56,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 441 events. 233/441 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1890 event pairs, 61 based on Foata normal form. 37/464 useless extension candidates. Maximal degree in co-relation 1170. Up to 140 conditions per place. [2023-08-30 03:19:56,641 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2023-08-30 03:19:56,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow [2023-08-30 03:19:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:19:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:19:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-08-30 03:19:56,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46652110625909754 [2023-08-30 03:19:56,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-08-30 03:19:56,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-08-30 03:19:56,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:56,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-08-30 03:19:56,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,647 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 641 transitions. [2023-08-30 03:19:56,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow [2023-08-30 03:19:56,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 03:19:56,651 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-30 03:19:56,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-30 03:19:56,652 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-30 03:19:56,652 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-30 03:19:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:56,653 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-30 03:19:56,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:19:56,860 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-30 03:19:56,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:56,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1044811710, now seen corresponding path program 1 times [2023-08-30 03:19:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949468225] [2023-08-30 03:19:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:56,861 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-30 03:19:56,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:56,863 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-30 03:19:56,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:19:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:56,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:19:56,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:56,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-30 03:19:56,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:56,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949468225] [2023-08-30 03:19:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949468225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:56,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:19:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888960261] [2023-08-30 03:19:56,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:56,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:19:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:56,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:19:56,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:19:56,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-30 03:19:56,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:56,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:56,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-30 03:19:56,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:57,196 INFO L130 PetriNetUnfolder]: 143/279 cut-off events. [2023-08-30 03:19:57,196 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2023-08-30 03:19:57,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 279 events. 143/279 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1085 event pairs, 56 based on Foata normal form. 10/284 useless extension candidates. Maximal degree in co-relation 803. Up to 108 conditions per place. [2023-08-30 03:19:57,198 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2023-08-30 03:19:57,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow [2023-08-30 03:19:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:19:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:19:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2023-08-30 03:19:57,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45414847161572053 [2023-08-30 03:19:57,204 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2023-08-30 03:19:57,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2023-08-30 03:19:57,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:57,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2023-08-30 03:19:57,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:57,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:57,210 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:57,210 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 728 transitions. [2023-08-30 03:19:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow [2023-08-30 03:19:57,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 03:19:57,217 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-30 03:19:57,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-30 03:19:57,219 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-30 03:19:57,219 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-30 03:19:57,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:57,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:57,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:57,234 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-30 03:19:57,434 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-30 03:19:57,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:57,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 907167875, now seen corresponding path program 1 times [2023-08-30 03:19:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977444617] [2023-08-30 03:19:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:57,436 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-30 03:19:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:57,437 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-30 03:19:57,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:19:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:57,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 03:19:57,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:57,868 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-30 03:19:57,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:57,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977444617] [2023-08-30 03:19:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977444617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:57,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 03:19:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324438512] [2023-08-30 03:19:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:57,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 03:19:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 03:19:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-30 03:19:57,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-30 03:19:57,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:57,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:57,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-30 03:19:57,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:58,170 INFO L130 PetriNetUnfolder]: 181/355 cut-off events. [2023-08-30 03:19:58,170 INFO L131 PetriNetUnfolder]: For 378/378 co-relation queries the response was YES. [2023-08-30 03:19:58,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 355 events. 181/355 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1478 event pairs, 9 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1022. Up to 151 conditions per place. [2023-08-30 03:19:58,172 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 68 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2023-08-30 03:19:58,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 530 flow [2023-08-30 03:19:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 03:19:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 03:19:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2023-08-30 03:19:58,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492964580300825 [2023-08-30 03:19:58,175 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2023-08-30 03:19:58,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2023-08-30 03:19:58,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:58,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2023-08-30 03:19:58,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.88888888888889) internal successors, (926), 9 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:58,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:58,179 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:58,179 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 9 states and 926 transitions. [2023-08-30 03:19:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 530 flow [2023-08-30 03:19:58,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 440 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-30 03:19:58,182 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 137 flow [2023-08-30 03:19:58,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 03:19:58,184 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-30 03:19:58,184 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 137 flow [2023-08-30 03:19:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:58,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:58,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:58,195 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-30 03:19:58,392 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-30 03:19:58,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:58,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1421158699, now seen corresponding path program 1 times [2023-08-30 03:19:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219942100] [2023-08-30 03:19:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:19:58,394 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-30 03:19:58,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:58,394 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-30 03:19:58,395 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-30 03:19:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:19:58,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 03:19:58,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:58,788 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-30 03:19:58,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:58,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:58,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219942100] [2023-08-30 03:19:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219942100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:58,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957678792] [2023-08-30 03:19:58,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:19:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:19:58,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:19:58,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 229 [2023-08-30 03:19:58,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:58,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:58,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 229 [2023-08-30 03:19:58,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:59,046 INFO L130 PetriNetUnfolder]: 168/321 cut-off events. [2023-08-30 03:19:59,046 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-30 03:19:59,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 321 events. 168/321 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1261 event pairs, 49 based on Foata normal form. 2/323 useless extension candidates. Maximal degree in co-relation 931. Up to 266 conditions per place. [2023-08-30 03:19:59,048 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 28 selfloop transitions, 3 changer transitions 9/44 dead transitions. [2023-08-30 03:19:59,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 263 flow [2023-08-30 03:19:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:19:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:19:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-30 03:19:59,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096069868995633 [2023-08-30 03:19:59,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-30 03:19:59,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-30 03:19:59,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:59,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-30 03:19:59,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,052 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 137 flow. Second operand 5 states and 469 transitions. [2023-08-30 03:19:59,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 263 flow [2023-08-30 03:19:59,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:19:59,054 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 125 flow [2023-08-30 03:19:59,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2023-08-30 03:19:59,054 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-30 03:19:59,054 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 125 flow [2023-08-30 03:19:59,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:59,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:59,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-30 03:19:59,262 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-30 03:19:59,262 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:59,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1512587955, now seen corresponding path program 2 times [2023-08-30 03:19:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369789806] [2023-08-30 03:19:59,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:19:59,263 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-30 03:19:59,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:59,264 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-30 03:19:59,266 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-30 03:19:59,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:19:59,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:19:59,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:19:59,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:19:59,378 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-30 03:19:59,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:19:59,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:19:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369789806] [2023-08-30 03:19:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369789806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:19:59,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:19:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:19:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740544319] [2023-08-30 03:19:59,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:19:59,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:19:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:19:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:19:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:19:59,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-30 03:19:59,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:19:59,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-30 03:19:59,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:19:59,483 INFO L130 PetriNetUnfolder]: 167/323 cut-off events. [2023-08-30 03:19:59,484 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2023-08-30 03:19:59,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 323 events. 167/323 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1240 event pairs, 45 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 935. Up to 169 conditions per place. [2023-08-30 03:19:59,485 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 30 selfloop transitions, 2 changer transitions 15/50 dead transitions. [2023-08-30 03:19:59,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 307 flow [2023-08-30 03:19:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:19:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:19:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-08-30 03:19:59,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650655021834061 [2023-08-30 03:19:59,486 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-08-30 03:19:59,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-08-30 03:19:59,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:19:59,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-08-30 03:19:59,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,488 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,488 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 125 flow. Second operand 4 states and 426 transitions. [2023-08-30 03:19:59,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 307 flow [2023-08-30 03:19:59,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 295 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 03:19:59,490 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 126 flow [2023-08-30 03:19:59,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-30 03:19:59,490 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-30 03:19:59,490 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 126 flow [2023-08-30 03:19:59,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:19:59,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:19:59,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:19:59,501 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-30 03:19:59,698 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-30 03:19:59,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:19:59,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:19:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1744401845, now seen corresponding path program 3 times [2023-08-30 03:19:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:19:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657295227] [2023-08-30 03:19:59,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:19:59,699 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-30 03:19:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:19:59,700 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-30 03:19:59,702 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-30 03:19:59,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:19:59,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:19:59,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:19:59,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:20:00,001 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-30 03:20:00,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:20:00,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:20:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657295227] [2023-08-30 03:20:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657295227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:20:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:20:00,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:20:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918077813] [2023-08-30 03:20:00,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:20:00,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:20:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:20:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:20:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:20:00,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-30 03:20:00,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:20:00,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:20:00,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-30 03:20:00,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:20:00,103 INFO L130 PetriNetUnfolder]: 142/286 cut-off events. [2023-08-30 03:20:00,103 INFO L131 PetriNetUnfolder]: For 189/195 co-relation queries the response was YES. [2023-08-30 03:20:00,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 286 events. 142/286 cut-off events. For 189/195 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1069 event pairs, 66 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 855. Up to 174 conditions per place. [2023-08-30 03:20:00,105 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 28 selfloop transitions, 2 changer transitions 19/51 dead transitions. [2023-08-30 03:20:00,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 312 flow [2023-08-30 03:20:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:20:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:20:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-30 03:20:00,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672489082969432 [2023-08-30 03:20:00,106 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-30 03:20:00,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-30 03:20:00,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:20:00,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-30 03:20:00,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:20:00,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:20:00,109 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:20:00,110 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 126 flow. Second operand 4 states and 428 transitions. [2023-08-30 03:20:00,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 312 flow [2023-08-30 03:20:00,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 300 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:20:00,112 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 120 flow [2023-08-30 03:20:00,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-30 03:20:00,112 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-30 03:20:00,113 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 120 flow [2023-08-30 03:20:00,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:20:00,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:20:00,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:20:00,121 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-30 03:20:00,321 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-30 03:20:00,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-30 03:20:00,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:20:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1566434221, now seen corresponding path program 4 times [2023-08-30 03:20:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:20:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470706587] [2023-08-30 03:20:00,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:20:00,322 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-30 03:20:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:20:00,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:20:00,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 03:20:00,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:20:00,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 03:20:00,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:20:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:20:00,523 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:20:00,523 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:20:00,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-30 03:20:00,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-30 03:20:00,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-30 03:20:00,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-30 03:20:00,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-30 03:20:00,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-30 03:20:00,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:20:00,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:20:00,726 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-30 03:20:00,730 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:20:00,730 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:20:00,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:20:00 BasicIcfg [2023-08-30 03:20:00,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:20:00,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:20:00,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:20:00,773 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:20:00,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:19:49" (3/4) ... [2023-08-30 03:20:00,775 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:20:00,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:20:00,775 INFO L158 Benchmark]: Toolchain (without parser) took 12409.82ms. Allocated memory was 77.6MB in the beginning and 167.8MB in the end (delta: 90.2MB). Free memory was 54.8MB in the beginning and 82.0MB in the end (delta: -27.2MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2023-08-30 03:20:00,775 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:20:00,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.24ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 54.6MB in the beginning and 91.4MB in the end (delta: -36.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2023-08-30 03:20:00,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.89ms. Allocated memory is still 113.2MB. Free memory was 91.4MB in the beginning and 88.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:20:00,778 INFO L158 Benchmark]: Boogie Preprocessor took 45.46ms. Allocated memory is still 113.2MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:20:00,778 INFO L158 Benchmark]: RCFGBuilder took 621.42ms. Allocated memory is still 113.2MB. Free memory was 86.7MB in the beginning and 88.1MB in the end (delta: -1.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2023-08-30 03:20:00,778 INFO L158 Benchmark]: TraceAbstraction took 11265.67ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 87.4MB in the beginning and 82.0MB in the end (delta: 5.3MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2023-08-30 03:20:00,779 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 167.8MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:20:00,780 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 77.6MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.24ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 54.6MB in the beginning and 91.4MB in the end (delta: -36.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.89ms. Allocated memory is still 113.2MB. Free memory was 91.4MB in the beginning and 88.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.46ms. Allocated memory is still 113.2MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 621.42ms. Allocated memory is still 113.2MB. Free memory was 86.7MB in the beginning and 88.1MB in the end (delta: -1.4MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11265.67ms. Allocated memory was 113.2MB in the beginning and 167.8MB in the end (delta: 54.5MB). Free memory was 87.4MB in the beginning and 82.0MB in the end (delta: 5.3MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 167.8MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 122 PlacesBefore, 42 PlacesAfterwards, 114 TransitionsBefore, 33 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 5468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2501, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1122, independent: 1089, independent conditional: 0, independent unconditional: 1089, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2501, independent: 1250, independent conditional: 0, independent unconditional: 1250, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 1122, unknown conditional: 0, unknown unconditional: 1122] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={3:0}, weak$$choice0=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=0] [L818] 0 pthread_t t2490; [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={3:0}, t2490={7:0}, weak$$choice0=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={3:0}, t2490={7:0}, t2491={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={3:0}, t2490={7:0}, t2491={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 817]: 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: 819]: 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, 144 locations, 13 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: 11.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 12 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 17 QuantifiedInterpolants, 1276 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1110 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-30 03:20:00,800 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