./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:23:13,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:23:13,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:23:13,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:23:13,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:23:13,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:23:13,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:23:13,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:23:13,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:23:13,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:23:13,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:23:13,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:23:13,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:23:13,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:23:13,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:23:13,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:23:13,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:23:13,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:23:13,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:23:13,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:23:13,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:23:13,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:23:13,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:23:13,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:23:13,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:23:13,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:23:13,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:23:13,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:23:13,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:23:13,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:23:13,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:23:13,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:23:13,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:23:13,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:23:13,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:23:13,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:23:13,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:23:13,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:23:13,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:23:13,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:23:13,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:23:13,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:23:13,957 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:23:13,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:23:13,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:23:13,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:23:13,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:23:13,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:23:13,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:23:13,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:23:13,960 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:23:13,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:23:13,961 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:23:13,962 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:23:13,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:23:13,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:23:13,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:23:13,962 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:23:13,963 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:23:13,963 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:23:13,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:23:13,963 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:23:13,964 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:23:13,964 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:23:13,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:23:13,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:23:13,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:23:13,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:13,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:23:13,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:23:13,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:23:13,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:23:13,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:23:13,966 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:23:13,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:23:13,967 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:23:13,967 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:23:14,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:23:14,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:23:14,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:23:14,348 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:23:14,348 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:23:14,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:23:15,490 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:23:15,737 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:23:15,738 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:23:15,753 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b253c479/2e1f42deb41b429fa1861870939b51b2/FLAGc25db32a0 [2023-08-29 20:23:15,773 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b253c479/2e1f42deb41b429fa1861870939b51b2 [2023-08-29 20:23:15,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:23:15,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:23:15,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:15,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:23:15,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:23:15,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:15" (1/1) ... [2023-08-29 20:23:15,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b37271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:15, skipping insertion in model container [2023-08-29 20:23:15,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:23:15" (1/1) ... [2023-08-29 20:23:15,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:23:15,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:23:15,958 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-29 20:23:16,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:16,181 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:23:16,196 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-29 20:23:16,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:23:16,296 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:16,297 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:23:16,302 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:23:16,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16 WrapperNode [2023-08-29 20:23:16,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:23:16,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:16,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:23:16,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:23:16,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,379 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-29 20:23:16,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:23:16,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:23:16,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:23:16,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:23:16,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,425 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:23:16,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:23:16,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:23:16,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:23:16,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (1/1) ... [2023-08-29 20:23:16,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:23:16,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:23:16,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:23:16,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:23:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:23:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:23:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:23:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:23:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:23:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:23:16,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:23:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:23:16,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:23:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:23:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:23:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:23:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:23:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:23:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:23:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:23:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:23:16,518 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:23:16,713 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:23:16,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:23:17,094 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:23:17,192 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:23:17,192 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:23:17,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:17 BoogieIcfgContainer [2023-08-29 20:23:17,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:23:17,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:23:17,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:23:17,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:23:17,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:23:15" (1/3) ... [2023-08-29 20:23:17,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc4ba30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:17, skipping insertion in model container [2023-08-29 20:23:17,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:23:16" (2/3) ... [2023-08-29 20:23:17,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc4ba30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:23:17, skipping insertion in model container [2023-08-29 20:23:17,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:17" (3/3) ... [2023-08-29 20:23:17,204 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:23:17,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:23:17,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:23:17,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:23:17,290 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:23:17,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:23:17,388 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:23:17,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:17,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:23:17,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:23:17,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-29 20:23:17,402 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:23:17,409 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:23:17,412 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:23:17,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-29 20:23:17,440 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:23:17,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:17,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:23:17,443 INFO L119 LiptonReduction]: Number of co-enabled transitions 3320 [2023-08-29 20:23:21,821 INFO L134 LiptonReduction]: Checked pairs total: 9639 [2023-08-29 20:23:21,821 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-29 20:23:21,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:23:21,842 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;@7ab44352, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:23:21,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:23:21,843 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:23:21,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:21,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:21,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:23:21,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:21,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash 590, now seen corresponding path program 1 times [2023-08-29 20:23:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:21,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380876208] [2023-08-29 20:23:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:21,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380876208] [2023-08-29 20:23:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380876208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:21,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:21,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:23:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573771476] [2023-08-29 20:23:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:21,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:23:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:23:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:23:22,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-29 20:23:22,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:22,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:22,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-29 20:23:22,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:23,176 INFO L130 PetriNetUnfolder]: 5761/7953 cut-off events. [2023-08-29 20:23:23,177 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-29 20:23:23,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15943 conditions, 7953 events. 5761/7953 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 42043 event pairs, 5761 based on Foata normal form. 240/6872 useless extension candidates. Maximal degree in co-relation 15931. Up to 7833 conditions per place. [2023-08-29 20:23:23,234 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:23:23,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-29 20:23:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:23:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:23:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-08-29 20:23:23,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330882352941176 [2023-08-29 20:23:23,252 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-08-29 20:23:23,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-08-29 20:23:23,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:23,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-08-29 20:23:23,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:23,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 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-29 20:23:23,265 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 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-29 20:23:23,266 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 290 transitions. [2023-08-29 20:23:23,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-29 20:23:23,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:23:23,273 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:23:23,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:23:23,277 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:23:23,278 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:23:23,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:23,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:23,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:23,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:23:23,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:23,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1373493098, now seen corresponding path program 1 times [2023-08-29 20:23:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332479106] [2023-08-29 20:23:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332479106] [2023-08-29 20:23:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332479106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:23:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153339457] [2023-08-29 20:23:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:23,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 272 [2023-08-29 20:23:23,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:23,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:23,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 272 [2023-08-29 20:23:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:24,393 INFO L130 PetriNetUnfolder]: 4535/6637 cut-off events. [2023-08-29 20:23:24,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:23:24,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12966 conditions, 6637 events. 4535/6637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 39479 event pairs, 857 based on Foata normal form. 0/5997 useless extension candidates. Maximal degree in co-relation 12963. Up to 4903 conditions per place. [2023-08-29 20:23:24,427 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 37 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2023-08-29 20:23:24,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 192 flow [2023-08-29 20:23:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-29 20:23:24,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171568627450981 [2023-08-29 20:23:24,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-29 20:23:24,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-29 20:23:24,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:24,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-29 20:23:24,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:24,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:24,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:24,434 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 422 transitions. [2023-08-29 20:23:24,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 192 flow [2023-08-29 20:23:24,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:23:24,435 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-08-29 20:23:24,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:23:24,436 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:23:24,437 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-08-29 20:23:24,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:24,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:24,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:24,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:23:24,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:24,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1949499366, now seen corresponding path program 1 times [2023-08-29 20:23:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847917845] [2023-08-29 20:23:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:24,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:25,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:25,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847917845] [2023-08-29 20:23:25,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847917845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:25,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:25,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:25,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414558603] [2023-08-29 20:23:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:25,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:25,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:26,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:23:26,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:26,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:26,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:23:26,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:27,674 INFO L130 PetriNetUnfolder]: 10807/14504 cut-off events. [2023-08-29 20:23:27,674 INFO L131 PetriNetUnfolder]: For 628/628 co-relation queries the response was YES. [2023-08-29 20:23:27,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29847 conditions, 14504 events. 10807/14504 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 70472 event pairs, 2087 based on Foata normal form. 0/14116 useless extension candidates. Maximal degree in co-relation 29843. Up to 6785 conditions per place. [2023-08-29 20:23:27,764 INFO L137 encePairwiseOnDemand]: 260/272 looper letters, 74 selfloop transitions, 20 changer transitions 0/95 dead transitions. [2023-08-29 20:23:27,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 95 transitions, 396 flow [2023-08-29 20:23:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-08-29 20:23:27,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46638655462184875 [2023-08-29 20:23:27,767 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-08-29 20:23:27,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-08-29 20:23:27,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:27,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-08-29 20:23:27,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:27,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:27,775 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:27,775 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 7 states and 888 transitions. [2023-08-29 20:23:27,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 95 transitions, 396 flow [2023-08-29 20:23:27,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:23:27,781 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 217 flow [2023-08-29 20:23:27,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-08-29 20:23:27,782 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-29 20:23:27,785 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 217 flow [2023-08-29 20:23:27,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:27,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:27,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:27,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:23:27,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:27,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1949499307, now seen corresponding path program 1 times [2023-08-29 20:23:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:27,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734298417] [2023-08-29 20:23:27,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:28,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:28,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734298417] [2023-08-29 20:23:28,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734298417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:28,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526246890] [2023-08-29 20:23:28,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:28,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:28,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 272 [2023-08-29 20:23:28,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:28,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:28,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 272 [2023-08-29 20:23:28,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:29,898 INFO L130 PetriNetUnfolder]: 6427/9089 cut-off events. [2023-08-29 20:23:29,899 INFO L131 PetriNetUnfolder]: For 8276/9122 co-relation queries the response was YES. [2023-08-29 20:23:29,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26281 conditions, 9089 events. 6427/9089 cut-off events. For 8276/9122 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 50152 event pairs, 2177 based on Foata normal form. 956/9515 useless extension candidates. Maximal degree in co-relation 26273. Up to 7772 conditions per place. [2023-08-29 20:23:30,074 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 42 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2023-08-29 20:23:30,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 335 flow [2023-08-29 20:23:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:23:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:23:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-29 20:23:30,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209558823529412 [2023-08-29 20:23:30,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-29 20:23:30,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-29 20:23:30,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:30,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-29 20:23:30,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 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-29 20:23:30,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:30,083 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:30,083 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 217 flow. Second operand 6 states and 687 transitions. [2023-08-29 20:23:30,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 335 flow [2023-08-29 20:23:30,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 335 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:23:30,096 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 201 flow [2023-08-29 20:23:30,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-29 20:23:30,097 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-29 20:23:30,097 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 201 flow [2023-08-29 20:23:30,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:30,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:30,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:23:30,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:30,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 799871744, now seen corresponding path program 1 times [2023-08-29 20:23:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:30,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921051186] [2023-08-29 20:23:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:30,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921051186] [2023-08-29 20:23:30,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921051186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:30,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:30,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488302899] [2023-08-29 20:23:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:30,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:30,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:23:30,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:30,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:30,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:23:30,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:32,072 INFO L130 PetriNetUnfolder]: 9735/14071 cut-off events. [2023-08-29 20:23:32,072 INFO L131 PetriNetUnfolder]: For 12910/14666 co-relation queries the response was YES. [2023-08-29 20:23:32,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40035 conditions, 14071 events. 9735/14071 cut-off events. For 12910/14666 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 84763 event pairs, 3716 based on Foata normal form. 667/14023 useless extension candidates. Maximal degree in co-relation 40026. Up to 9673 conditions per place. [2023-08-29 20:23:32,176 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 44 selfloop transitions, 7 changer transitions 24/82 dead transitions. [2023-08-29 20:23:32,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 476 flow [2023-08-29 20:23:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-29 20:23:32,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49926470588235294 [2023-08-29 20:23:32,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-29 20:23:32,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-29 20:23:32,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:32,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-29 20:23:32,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:32,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:32,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:32,184 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 201 flow. Second operand 5 states and 679 transitions. [2023-08-29 20:23:32,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 476 flow [2023-08-29 20:23:32,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 466 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:23:32,198 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 207 flow [2023-08-29 20:23:32,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-29 20:23:32,199 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-29 20:23:32,199 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 207 flow [2023-08-29 20:23:32,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:32,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:32,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:32,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:23:32,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:32,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash -973805041, now seen corresponding path program 1 times [2023-08-29 20:23:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912271599] [2023-08-29 20:23:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912271599] [2023-08-29 20:23:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912271599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062445109] [2023-08-29 20:23:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:33,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:33,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 272 [2023-08-29 20:23:33,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:33,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:33,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 272 [2023-08-29 20:23:33,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:35,016 INFO L130 PetriNetUnfolder]: 12335/16844 cut-off events. [2023-08-29 20:23:35,016 INFO L131 PetriNetUnfolder]: For 27387/27387 co-relation queries the response was YES. [2023-08-29 20:23:35,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55605 conditions, 16844 events. 12335/16844 cut-off events. For 27387/27387 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 83760 event pairs, 2103 based on Foata normal form. 468/17312 useless extension candidates. Maximal degree in co-relation 55593. Up to 11297 conditions per place. [2023-08-29 20:23:35,135 INFO L137 encePairwiseOnDemand]: 258/272 looper letters, 53 selfloop transitions, 21 changer transitions 40/114 dead transitions. [2023-08-29 20:23:35,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 114 transitions, 759 flow [2023-08-29 20:23:35,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-08-29 20:23:35,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46271008403361347 [2023-08-29 20:23:35,139 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-08-29 20:23:35,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-08-29 20:23:35,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:35,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-08-29 20:23:35,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:35,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:35,144 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:35,144 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 207 flow. Second operand 7 states and 881 transitions. [2023-08-29 20:23:35,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 114 transitions, 759 flow [2023-08-29 20:23:35,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 743 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:35,281 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 359 flow [2023-08-29 20:23:35,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-08-29 20:23:35,284 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-29 20:23:35,284 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 359 flow [2023-08-29 20:23:35,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:35,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:35,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:35,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:23:35,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:35,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -910379041, now seen corresponding path program 2 times [2023-08-29 20:23:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:35,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447643562] [2023-08-29 20:23:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447643562] [2023-08-29 20:23:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447643562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899182942] [2023-08-29 20:23:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:35,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:35,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:23:35,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:35,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:35,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:23:35,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:37,245 INFO L130 PetriNetUnfolder]: 9127/12895 cut-off events. [2023-08-29 20:23:37,245 INFO L131 PetriNetUnfolder]: For 37757/38596 co-relation queries the response was YES. [2023-08-29 20:23:37,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53947 conditions, 12895 events. 9127/12895 cut-off events. For 37757/38596 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 70142 event pairs, 2449 based on Foata normal form. 960/13465 useless extension candidates. Maximal degree in co-relation 53933. Up to 8542 conditions per place. [2023-08-29 20:23:37,384 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 57 selfloop transitions, 12 changer transitions 31/112 dead transitions. [2023-08-29 20:23:37,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 917 flow [2023-08-29 20:23:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-29 20:23:37,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49737394957983194 [2023-08-29 20:23:37,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-29 20:23:37,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-29 20:23:37,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:37,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-29 20:23:37,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:37,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:37,394 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:37,394 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 359 flow. Second operand 7 states and 947 transitions. [2023-08-29 20:23:37,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 917 flow [2023-08-29 20:23:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 112 transitions, 905 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:37,558 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 509 flow [2023-08-29 20:23:37,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=509, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-29 20:23:37,558 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2023-08-29 20:23:37,559 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 509 flow [2023-08-29 20:23:37,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:37,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:37,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:37,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:23:37,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:37,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -889140327, now seen corresponding path program 1 times [2023-08-29 20:23:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:37,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953066956] [2023-08-29 20:23:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953066956] [2023-08-29 20:23:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953066956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:38,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203476344] [2023-08-29 20:23:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:38,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:38,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:38,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-29 20:23:38,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:38,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:38,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-29 20:23:38,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:39,445 INFO L130 PetriNetUnfolder]: 9326/13224 cut-off events. [2023-08-29 20:23:39,445 INFO L131 PetriNetUnfolder]: For 56891/57692 co-relation queries the response was YES. [2023-08-29 20:23:39,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63482 conditions, 13224 events. 9326/13224 cut-off events. For 56891/57692 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 72009 event pairs, 2136 based on Foata normal form. 519/13365 useless extension candidates. Maximal degree in co-relation 63464. Up to 8472 conditions per place. [2023-08-29 20:23:39,578 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 73 selfloop transitions, 23 changer transitions 35/143 dead transitions. [2023-08-29 20:23:39,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1410 flow [2023-08-29 20:23:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:23:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:23:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1203 transitions. [2023-08-29 20:23:39,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142156862745096 [2023-08-29 20:23:39,583 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1203 transitions. [2023-08-29 20:23:39,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1203 transitions. [2023-08-29 20:23:39,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:39,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1203 transitions. [2023-08-29 20:23:39,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.66666666666666) internal successors, (1203), 9 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:39,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:39,590 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:39,590 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 509 flow. Second operand 9 states and 1203 transitions. [2023-08-29 20:23:39,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1410 flow [2023-08-29 20:23:39,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 143 transitions, 1376 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:39,777 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 798 flow [2023-08-29 20:23:39,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=798, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2023-08-29 20:23:39,780 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2023-08-29 20:23:39,780 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 798 flow [2023-08-29 20:23:39,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:39,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:39,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:39,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:23:39,781 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:39,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1041084682, now seen corresponding path program 1 times [2023-08-29 20:23:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:39,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035451078] [2023-08-29 20:23:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035451078] [2023-08-29 20:23:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035451078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:40,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226494815] [2023-08-29 20:23:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:40,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:23:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:23:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:23:40,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:23:40,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 798 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 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-29 20:23:40,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:40,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:23:40,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:41,737 INFO L130 PetriNetUnfolder]: 8969/12697 cut-off events. [2023-08-29 20:23:41,737 INFO L131 PetriNetUnfolder]: For 96852/97607 co-relation queries the response was YES. [2023-08-29 20:23:41,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69923 conditions, 12697 events. 8969/12697 cut-off events. For 96852/97607 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 68749 event pairs, 1657 based on Foata normal form. 536/12840 useless extension candidates. Maximal degree in co-relation 69901. Up to 8681 conditions per place. [2023-08-29 20:23:41,844 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 76 selfloop transitions, 12 changer transitions 25/125 dead transitions. [2023-08-29 20:23:41,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 125 transitions, 1404 flow [2023-08-29 20:23:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2023-08-29 20:23:41,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957983193277311 [2023-08-29 20:23:41,848 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2023-08-29 20:23:41,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2023-08-29 20:23:41,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:41,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2023-08-29 20:23:41,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:41,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:41,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:41,854 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 798 flow. Second operand 7 states and 944 transitions. [2023-08-29 20:23:41,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 125 transitions, 1404 flow [2023-08-29 20:23:42,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 125 transitions, 1336 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:42,289 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 835 flow [2023-08-29 20:23:42,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=835, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-08-29 20:23:42,289 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2023-08-29 20:23:42,289 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 835 flow [2023-08-29 20:23:42,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 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-29 20:23:42,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:42,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:42,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:23:42,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:42,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1680096810, now seen corresponding path program 1 times [2023-08-29 20:23:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017621049] [2023-08-29 20:23:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017621049] [2023-08-29 20:23:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017621049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:43,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564672207] [2023-08-29 20:23:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:43,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:23:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:43,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:23:43,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:23:43,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 272 [2023-08-29 20:23:43,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 835 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:43,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:43,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 272 [2023-08-29 20:23:43,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:45,092 INFO L130 PetriNetUnfolder]: 12825/17384 cut-off events. [2023-08-29 20:23:45,093 INFO L131 PetriNetUnfolder]: For 115494/115494 co-relation queries the response was YES. [2023-08-29 20:23:45,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92941 conditions, 17384 events. 12825/17384 cut-off events. For 115494/115494 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 85779 event pairs, 3400 based on Foata normal form. 264/17648 useless extension candidates. Maximal degree in co-relation 92916. Up to 12018 conditions per place. [2023-08-29 20:23:45,284 INFO L137 encePairwiseOnDemand]: 258/272 looper letters, 107 selfloop transitions, 83 changer transitions 35/225 dead transitions. [2023-08-29 20:23:45,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 225 transitions, 2652 flow [2023-08-29 20:23:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:23:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:23:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2023-08-29 20:23:45,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4522058823529412 [2023-08-29 20:23:45,288 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2023-08-29 20:23:45,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2023-08-29 20:23:45,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:45,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2023-08-29 20:23:45,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:45,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 272.0) internal successors, (2992), 11 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:45,296 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 272.0) internal successors, (2992), 11 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:45,296 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 835 flow. Second operand 10 states and 1230 transitions. [2023-08-29 20:23:45,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 225 transitions, 2652 flow [2023-08-29 20:23:45,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 225 transitions, 2542 flow, removed 50 selfloop flow, removed 5 redundant places. [2023-08-29 20:23:45,589 INFO L231 Difference]: Finished difference. Result has 85 places, 135 transitions, 1881 flow [2023-08-29 20:23:45,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1881, PETRI_PLACES=85, PETRI_TRANSITIONS=135} [2023-08-29 20:23:45,590 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-29 20:23:45,591 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 135 transitions, 1881 flow [2023-08-29 20:23:45,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:45,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:45,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:45,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:23:45,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:45,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1043547912, now seen corresponding path program 2 times [2023-08-29 20:23:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741380051] [2023-08-29 20:23:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741380051] [2023-08-29 20:23:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741380051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:45,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984842429] [2023-08-29 20:23:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:45,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:23:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:23:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:23:46,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:23:46,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 135 transitions, 1881 flow. Second operand has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 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-29 20:23:46,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:46,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:23:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:47,871 INFO L130 PetriNetUnfolder]: 11760/16708 cut-off events. [2023-08-29 20:23:47,872 INFO L131 PetriNetUnfolder]: For 158311/159508 co-relation queries the response was YES. [2023-08-29 20:23:47,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105489 conditions, 16708 events. 11760/16708 cut-off events. For 158311/159508 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 94656 event pairs, 1371 based on Foata normal form. 1008/17411 useless extension candidates. Maximal degree in co-relation 105460. Up to 9385 conditions per place. [2023-08-29 20:23:48,002 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 96 selfloop transitions, 58 changer transitions 24/206 dead transitions. [2023-08-29 20:23:48,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 206 transitions, 2904 flow [2023-08-29 20:23:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:23:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:23:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1074 transitions. [2023-08-29 20:23:48,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49356617647058826 [2023-08-29 20:23:48,006 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1074 transitions. [2023-08-29 20:23:48,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1074 transitions. [2023-08-29 20:23:48,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:48,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1074 transitions. [2023-08-29 20:23:48,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:48,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:48,012 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:48,013 INFO L175 Difference]: Start difference. First operand has 85 places, 135 transitions, 1881 flow. Second operand 8 states and 1074 transitions. [2023-08-29 20:23:48,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 206 transitions, 2904 flow [2023-08-29 20:23:48,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 206 transitions, 2801 flow, removed 51 selfloop flow, removed 4 redundant places. [2023-08-29 20:23:48,617 INFO L231 Difference]: Finished difference. Result has 88 places, 141 transitions, 2114 flow [2023-08-29 20:23:48,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2114, PETRI_PLACES=88, PETRI_TRANSITIONS=141} [2023-08-29 20:23:48,618 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-29 20:23:48,618 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 141 transitions, 2114 flow [2023-08-29 20:23:48,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 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-29 20:23:48,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:48,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:48,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:23:48,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:48,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash -787908486, now seen corresponding path program 1 times [2023-08-29 20:23:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483501914] [2023-08-29 20:23:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:48,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:48,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483501914] [2023-08-29 20:23:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483501914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:48,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:23:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820361933] [2023-08-29 20:23:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:48,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:23:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:48,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:23:48,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:23:48,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:23:48,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 141 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:48,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:48,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:23:48,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:50,019 INFO L130 PetriNetUnfolder]: 6473/9277 cut-off events. [2023-08-29 20:23:50,020 INFO L131 PetriNetUnfolder]: For 133312/136573 co-relation queries the response was YES. [2023-08-29 20:23:50,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63962 conditions, 9277 events. 6473/9277 cut-off events. For 133312/136573 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 51121 event pairs, 1078 based on Foata normal form. 1474/10244 useless extension candidates. Maximal degree in co-relation 63933. Up to 6856 conditions per place. [2023-08-29 20:23:50,080 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 166 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2023-08-29 20:23:50,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 206 transitions, 3478 flow [2023-08-29 20:23:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:23:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:23:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-29 20:23:50,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987745098039216 [2023-08-29 20:23:50,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-29 20:23:50,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-29 20:23:50,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:50,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-29 20:23:50,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,085 INFO L175 Difference]: Start difference. First operand has 88 places, 141 transitions, 2114 flow. Second operand 3 states and 407 transitions. [2023-08-29 20:23:50,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 206 transitions, 3478 flow [2023-08-29 20:23:50,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 206 transitions, 3371 flow, removed 45 selfloop flow, removed 5 redundant places. [2023-08-29 20:23:50,202 INFO L231 Difference]: Finished difference. Result has 84 places, 144 transitions, 2074 flow [2023-08-29 20:23:50,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2074, PETRI_PLACES=84, PETRI_TRANSITIONS=144} [2023-08-29 20:23:50,202 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2023-08-29 20:23:50,203 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 144 transitions, 2074 flow [2023-08-29 20:23:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:50,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:50,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:23:50,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:50,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 519601972, now seen corresponding path program 1 times [2023-08-29 20:23:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:50,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123922696] [2023-08-29 20:23:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:50,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123922696] [2023-08-29 20:23:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123922696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:23:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196007090] [2023-08-29 20:23:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:50,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:23:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:50,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:23:50,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:23:50,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:23:50,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 144 transitions, 2074 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:50,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:23:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:50,944 INFO L130 PetriNetUnfolder]: 3264/4930 cut-off events. [2023-08-29 20:23:50,945 INFO L131 PetriNetUnfolder]: For 59773/61300 co-relation queries the response was YES. [2023-08-29 20:23:50,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33567 conditions, 4930 events. 3264/4930 cut-off events. For 59773/61300 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 26307 event pairs, 412 based on Foata normal form. 841/5585 useless extension candidates. Maximal degree in co-relation 33540. Up to 2759 conditions per place. [2023-08-29 20:23:50,982 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 190 selfloop transitions, 9 changer transitions 0/234 dead transitions. [2023-08-29 20:23:50,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 234 transitions, 3832 flow [2023-08-29 20:23:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:23:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:23:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-29 20:23:50,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:23:50,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-29 20:23:50,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-29 20:23:50,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:50,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-29 20:23:50,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,988 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:50,988 INFO L175 Difference]: Start difference. First operand has 84 places, 144 transitions, 2074 flow. Second operand 4 states and 544 transitions. [2023-08-29 20:23:50,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 234 transitions, 3832 flow [2023-08-29 20:23:51,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 234 transitions, 3827 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:23:51,056 INFO L231 Difference]: Finished difference. Result has 87 places, 133 transitions, 1866 flow [2023-08-29 20:23:51,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1866, PETRI_PLACES=87, PETRI_TRANSITIONS=133} [2023-08-29 20:23:51,057 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2023-08-29 20:23:51,057 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 133 transitions, 1866 flow [2023-08-29 20:23:51,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:51,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:51,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:51,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:23:51,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:51,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1518535058, now seen corresponding path program 1 times [2023-08-29 20:23:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843659599] [2023-08-29 20:23:51,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843659599] [2023-08-29 20:23:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843659599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:51,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106212195] [2023-08-29 20:23:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:51,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:51,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:23:51,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 133 transitions, 1866 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:51,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:51,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:23:51,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:51,718 INFO L130 PetriNetUnfolder]: 2384/3600 cut-off events. [2023-08-29 20:23:51,718 INFO L131 PetriNetUnfolder]: For 42923/43841 co-relation queries the response was YES. [2023-08-29 20:23:51,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25120 conditions, 3600 events. 2384/3600 cut-off events. For 42923/43841 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18630 event pairs, 287 based on Foata normal form. 520/3985 useless extension candidates. Maximal degree in co-relation 25092. Up to 1979 conditions per place. [2023-08-29 20:23:51,744 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 192 selfloop transitions, 13 changer transitions 0/240 dead transitions. [2023-08-29 20:23:51,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 240 transitions, 3892 flow [2023-08-29 20:23:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-29 20:23:51,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49926470588235294 [2023-08-29 20:23:51,746 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-29 20:23:51,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-29 20:23:51,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:51,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-29 20:23:51,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:51,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:51,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:51,751 INFO L175 Difference]: Start difference. First operand has 87 places, 133 transitions, 1866 flow. Second operand 5 states and 679 transitions. [2023-08-29 20:23:51,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 240 transitions, 3892 flow [2023-08-29 20:23:51,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 240 transitions, 3740 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-29 20:23:51,861 INFO L231 Difference]: Finished difference. Result has 88 places, 124 transitions, 1648 flow [2023-08-29 20:23:51,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1648, PETRI_PLACES=88, PETRI_TRANSITIONS=124} [2023-08-29 20:23:51,862 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-29 20:23:51,862 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 124 transitions, 1648 flow [2023-08-29 20:23:51,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:51,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:51,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:51,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:23:51,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:51,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1059419845, now seen corresponding path program 1 times [2023-08-29 20:23:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:51,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591192576] [2023-08-29 20:23:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591192576] [2023-08-29 20:23:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591192576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:52,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182205567] [2023-08-29 20:23:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:53,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 272 [2023-08-29 20:23:53,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 124 transitions, 1648 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:53,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:53,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 272 [2023-08-29 20:23:53,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:53,983 INFO L130 PetriNetUnfolder]: 4048/6035 cut-off events. [2023-08-29 20:23:53,983 INFO L131 PetriNetUnfolder]: For 57950/58281 co-relation queries the response was YES. [2023-08-29 20:23:54,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40429 conditions, 6035 events. 4048/6035 cut-off events. For 57950/58281 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31654 event pairs, 442 based on Foata normal form. 250/6240 useless extension candidates. Maximal degree in co-relation 40401. Up to 3014 conditions per place. [2023-08-29 20:23:54,027 INFO L137 encePairwiseOnDemand]: 258/272 looper letters, 163 selfloop transitions, 101 changer transitions 80/351 dead transitions. [2023-08-29 20:23:54,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 351 transitions, 5248 flow [2023-08-29 20:23:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:23:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:23:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-08-29 20:23:54,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46638655462184875 [2023-08-29 20:23:54,030 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-08-29 20:23:54,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-08-29 20:23:54,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:54,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-08-29 20:23:54,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:54,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:54,036 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:54,036 INFO L175 Difference]: Start difference. First operand has 88 places, 124 transitions, 1648 flow. Second operand 7 states and 888 transitions. [2023-08-29 20:23:54,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 351 transitions, 5248 flow [2023-08-29 20:23:54,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 351 transitions, 5128 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:54,424 INFO L231 Difference]: Finished difference. Result has 96 places, 182 transitions, 2824 flow [2023-08-29 20:23:54,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2824, PETRI_PLACES=96, PETRI_TRANSITIONS=182} [2023-08-29 20:23:54,424 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2023-08-29 20:23:54,424 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 182 transitions, 2824 flow [2023-08-29 20:23:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:54,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:54,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:54,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:23:54,425 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:54,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1561697153, now seen corresponding path program 2 times [2023-08-29 20:23:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:54,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125854811] [2023-08-29 20:23:54,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125854811] [2023-08-29 20:23:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125854811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223065788] [2023-08-29 20:23:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:55,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:55,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:23:55,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 182 transitions, 2824 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:55,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:55,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:23:55,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:56,231 INFO L130 PetriNetUnfolder]: 4833/7369 cut-off events. [2023-08-29 20:23:56,231 INFO L131 PetriNetUnfolder]: For 73639/74146 co-relation queries the response was YES. [2023-08-29 20:23:56,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50518 conditions, 7369 events. 4833/7369 cut-off events. For 73639/74146 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 41454 event pairs, 683 based on Foata normal form. 349/7669 useless extension candidates. Maximal degree in co-relation 50485. Up to 3572 conditions per place. [2023-08-29 20:23:56,276 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 124 selfloop transitions, 28 changer transitions 91/249 dead transitions. [2023-08-29 20:23:56,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 249 transitions, 4008 flow [2023-08-29 20:23:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2023-08-29 20:23:56,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46691176470588236 [2023-08-29 20:23:56,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2023-08-29 20:23:56,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2023-08-29 20:23:56,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:56,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2023-08-29 20:23:56,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,290 INFO L175 Difference]: Start difference. First operand has 96 places, 182 transitions, 2824 flow. Second operand 5 states and 635 transitions. [2023-08-29 20:23:56,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 249 transitions, 4008 flow [2023-08-29 20:23:56,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 249 transitions, 3982 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-29 20:23:56,675 INFO L231 Difference]: Finished difference. Result has 101 places, 124 transitions, 1824 flow [2023-08-29 20:23:56,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1824, PETRI_PLACES=101, PETRI_TRANSITIONS=124} [2023-08-29 20:23:56,676 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2023-08-29 20:23:56,676 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 124 transitions, 1824 flow [2023-08-29 20:23:56,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:56,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:56,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:23:56,677 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:56,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2062180359, now seen corresponding path program 3 times [2023-08-29 20:23:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556758425] [2023-08-29 20:23:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556758425] [2023-08-29 20:23:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556758425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:23:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843796121] [2023-08-29 20:23:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:56,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:23:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:23:56,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:23:56,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:23:56,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 124 transitions, 1824 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:56,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:56,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:23:56,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:57,509 INFO L130 PetriNetUnfolder]: 3023/4799 cut-off events. [2023-08-29 20:23:57,509 INFO L131 PetriNetUnfolder]: For 67654/68585 co-relation queries the response was YES. [2023-08-29 20:23:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33111 conditions, 4799 events. 3023/4799 cut-off events. For 67654/68585 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 29288 event pairs, 309 based on Foata normal form. 513/5160 useless extension candidates. Maximal degree in co-relation 33075. Up to 2373 conditions per place. [2023-08-29 20:23:57,535 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 85 selfloop transitions, 17 changer transitions 103/215 dead transitions. [2023-08-29 20:23:57,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 215 transitions, 3549 flow [2023-08-29 20:23:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:23:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:23:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-29 20:23:57,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49080882352941174 [2023-08-29 20:23:57,538 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-29 20:23:57,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-29 20:23:57,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:57,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-29 20:23:57,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:57,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:57,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:57,543 INFO L175 Difference]: Start difference. First operand has 101 places, 124 transitions, 1824 flow. Second operand 6 states and 801 transitions. [2023-08-29 20:23:57,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 215 transitions, 3549 flow [2023-08-29 20:23:57,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 215 transitions, 3310 flow, removed 92 selfloop flow, removed 3 redundant places. [2023-08-29 20:23:57,711 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 830 flow [2023-08-29 20:23:57,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=830, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2023-08-29 20:23:57,712 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2023-08-29 20:23:57,712 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 830 flow [2023-08-29 20:23:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:57,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:57,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:57,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:23:57,712 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:57,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1332312212, now seen corresponding path program 1 times [2023-08-29 20:23:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:57,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404149788] [2023-08-29 20:23:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:57,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:57,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404149788] [2023-08-29 20:23:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404149788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:57,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:23:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629820186] [2023-08-29 20:23:57,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:57,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:23:57,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:57,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:23:57,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:23:57,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:23:57,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 69 transitions, 830 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:57,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:57,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:23:57,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:23:58,311 INFO L130 PetriNetUnfolder]: 1296/2125 cut-off events. [2023-08-29 20:23:58,311 INFO L131 PetriNetUnfolder]: For 23192/23505 co-relation queries the response was YES. [2023-08-29 20:23:58,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13760 conditions, 2125 events. 1296/2125 cut-off events. For 23192/23505 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11170 event pairs, 193 based on Foata normal form. 55/2123 useless extension candidates. Maximal degree in co-relation 13725. Up to 1092 conditions per place. [2023-08-29 20:23:58,326 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 55 selfloop transitions, 1 changer transitions 69/130 dead transitions. [2023-08-29 20:23:58,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 130 transitions, 1709 flow [2023-08-29 20:23:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:23:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:23:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-29 20:23:58,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48823529411764705 [2023-08-29 20:23:58,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-29 20:23:58,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-29 20:23:58,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:23:58,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-29 20:23:58,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:58,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:58,332 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:58,332 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 830 flow. Second operand 5 states and 664 transitions. [2023-08-29 20:23:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 130 transitions, 1709 flow [2023-08-29 20:23:58,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 130 transitions, 1232 flow, removed 160 selfloop flow, removed 25 redundant places. [2023-08-29 20:23:58,399 INFO L231 Difference]: Finished difference. Result has 82 places, 48 transitions, 318 flow [2023-08-29 20:23:58,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=82, PETRI_TRANSITIONS=48} [2023-08-29 20:23:58,400 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2023-08-29 20:23:58,400 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 48 transitions, 318 flow [2023-08-29 20:23:58,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:58,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:23:58,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:23:58,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:23:58,401 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:23:58,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:23:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1961550190, now seen corresponding path program 2 times [2023-08-29 20:23:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:23:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93831682] [2023-08-29 20:23:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:23:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:23:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:23:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:23:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:23:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93831682] [2023-08-29 20:23:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93831682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:23:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:23:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:23:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470823106] [2023-08-29 20:23:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:23:59,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:23:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:23:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:23:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:23:59,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:23:59,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 48 transitions, 318 flow. Second operand has 10 states, 10 states have (on average 123.4) internal successors, (1234), 10 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:23:59,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:23:59,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:23:59,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:00,005 INFO L130 PetriNetUnfolder]: 993/1705 cut-off events. [2023-08-29 20:24:00,005 INFO L131 PetriNetUnfolder]: For 4634/4671 co-relation queries the response was YES. [2023-08-29 20:24:00,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 1705 events. 993/1705 cut-off events. For 4634/4671 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8749 event pairs, 203 based on Foata normal form. 26/1692 useless extension candidates. Maximal degree in co-relation 7239. Up to 530 conditions per place. [2023-08-29 20:24:00,012 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 64 selfloop transitions, 6 changer transitions 36/110 dead transitions. [2023-08-29 20:24:00,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 887 flow [2023-08-29 20:24:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:24:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:24:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 911 transitions. [2023-08-29 20:24:00,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47846638655462187 [2023-08-29 20:24:00,018 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 911 transitions. [2023-08-29 20:24:00,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 911 transitions. [2023-08-29 20:24:00,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:00,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 911 transitions. [2023-08-29 20:24:00,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:00,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:00,022 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:00,023 INFO L175 Difference]: Start difference. First operand has 82 places, 48 transitions, 318 flow. Second operand 7 states and 911 transitions. [2023-08-29 20:24:00,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 887 flow [2023-08-29 20:24:00,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 806 flow, removed 13 selfloop flow, removed 13 redundant places. [2023-08-29 20:24:00,045 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 284 flow [2023-08-29 20:24:00,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2023-08-29 20:24:00,046 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 20 predicate places. [2023-08-29 20:24:00,046 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 284 flow [2023-08-29 20:24:00,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 123.4) internal successors, (1234), 10 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:00,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:00,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:00,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:24:00,047 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:00,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2082962698, now seen corresponding path program 3 times [2023-08-29 20:24:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:24:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15528256] [2023-08-29 20:24:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:24:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:24:00,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:24:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:24:00,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:24:00,182 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:24:00,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:24:00,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:24:00,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:24:00,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:24:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:24:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:24:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:24:00,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:24:00,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:24:00,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:24:00,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:24:00,190 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:00,195 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:24:00,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:24:00,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:24:00 BasicIcfg [2023-08-29 20:24:00,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:24:00,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:24:00,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:24:00,283 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:24:00,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:23:17" (3/4) ... [2023-08-29 20:24:00,286 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:24:00,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:24:00,286 INFO L158 Benchmark]: Toolchain (without parser) took 44509.95ms. Allocated memory was 73.4MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 43.4MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-29 20:24:00,286 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:24:00,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.27ms. Allocated memory is still 73.4MB. Free memory was 43.2MB in the beginning and 39.0MB in the end (delta: 4.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2023-08-29 20:24:00,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.10ms. Allocated memory is still 73.4MB. Free memory was 39.0MB in the beginning and 36.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:00,287 INFO L158 Benchmark]: Boogie Preprocessor took 57.16ms. Allocated memory is still 73.4MB. Free memory was 36.2MB in the beginning and 34.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:00,287 INFO L158 Benchmark]: RCFGBuilder took 757.88ms. Allocated memory is still 73.4MB. Free memory was 34.1MB in the beginning and 40.3MB in the end (delta: -6.2MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:00,288 INFO L158 Benchmark]: TraceAbstraction took 43084.51ms. Allocated memory was 73.4MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 39.8MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-29 20:24:00,288 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 3.5GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:24:00,289 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.21ms. Allocated memory is still 56.6MB. Free memory was 34.3MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.27ms. Allocated memory is still 73.4MB. Free memory was 43.2MB in the beginning and 39.0MB in the end (delta: 4.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.10ms. Allocated memory is still 73.4MB. Free memory was 39.0MB in the beginning and 36.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.16ms. Allocated memory is still 73.4MB. Free memory was 36.2MB in the beginning and 34.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.88ms. Allocated memory is still 73.4MB. Free memory was 34.1MB in the beginning and 40.3MB in the end (delta: -6.2MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 43084.51ms. Allocated memory was 73.4MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 39.8MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 3.5GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 148 PlacesBefore, 53 PlacesAfterwards, 137 TransitionsBefore, 41 TransitionsAfterwards, 3320 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 9639 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4439, independent: 4201, independent conditional: 0, independent unconditional: 4201, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1730, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4439, independent: 2501, independent conditional: 0, independent unconditional: 2501, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1730, unknown conditional: 0, unknown unconditional: 1730] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 203, Positive conditional cache size: 0, Positive unconditional cache size: 203, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-3, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1324 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1068 mSDsluCounter, 766 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 654 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3407 IncrementalHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 112 mSDtfsCounter, 3407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2824occurred in iteration=15, InterpolantAutomatonStates: 113, 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.5s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 3109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:24:00,326 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/mix029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:24:02,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:24:02,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:24:02,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:24:02,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:24:02,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:24:02,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:24:02,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:24:02,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:24:02,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:24:02,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:24:02,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:24:02,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:24:02,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:24:02,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:24:02,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:24:02,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:24:02,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:24:02,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:24:02,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:24:02,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:24:02,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:24:02,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:24:02,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:24:02,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:24:02,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:24:02,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:24:02,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:24:02,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:24:02,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:24:02,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:24:02,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:24:02,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:24:02,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:24:02,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:24:02,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:24:02,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:24:02,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:24:02,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:24:02,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:24:02,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:24:02,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:24:02,552 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:24:02,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:24:02,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:24:02,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:24:02,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:24:02,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:24:02,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:24:02,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:24:02,555 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:24:02,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:24:02,556 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:24:02,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:24:02,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:24:02,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:24:02,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:24:02,557 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:24:02,558 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:24:02,558 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:24:02,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:24:02,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:24:02,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:24:02,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:24:02,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:24:02,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:24:02,559 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:24:02,559 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:24:02,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:24:02,559 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:24:02,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:24:02,560 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:24:02,560 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:24:02,560 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:24:02,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:24:02,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:24:02,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:24:02,864 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:24:02,864 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:24:02,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:24:04,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:24:04,247 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:24:04,247 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:24:04,257 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af8989be/0b417cc7bd4849bdaa9db66003b1f226/FLAGa04d87e00 [2023-08-29 20:24:04,269 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af8989be/0b417cc7bd4849bdaa9db66003b1f226 [2023-08-29 20:24:04,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:24:04,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:24:04,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:24:04,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:24:04,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:24:04,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cdec1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04, skipping insertion in model container [2023-08-29 20:24:04,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:24:04,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:24:04,439 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-29 20:24:04,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:24:04,696 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:24:04,709 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-08-29 20:24:04,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:24:04,806 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:24:04,806 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:24:04,812 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:24:04,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04 WrapperNode [2023-08-29 20:24:04,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:24:04,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:24:04,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:24:04,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:24:04,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,881 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-29 20:24:04,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:24:04,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:24:04,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:24:04,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:24:04,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,931 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:24:04,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:24:04,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:24:04,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:24:04,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (1/1) ... [2023-08-29 20:24:04,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:24:04,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:24:04,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:24:04,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:24:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:24:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:24:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:24:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:24:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:24:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:24:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:24:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:24:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:24:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:24:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:24:05,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:24:05,013 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:24:05,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:24:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:24:05,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:24:05,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:24:05,015 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:24:05,187 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:24:05,188 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:24:05,594 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:24:05,717 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:24:05,718 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:24:05,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:24:05 BoogieIcfgContainer [2023-08-29 20:24:05,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:24:05,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:24:05,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:24:05,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:24:05,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:24:04" (1/3) ... [2023-08-29 20:24:05,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fa6523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:24:05, skipping insertion in model container [2023-08-29 20:24:05,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:24:04" (2/3) ... [2023-08-29 20:24:05,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fa6523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:24:05, skipping insertion in model container [2023-08-29 20:24:05,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:24:05" (3/3) ... [2023-08-29 20:24:05,727 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-08-29 20:24:05,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:24:05,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:24:05,741 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:24:05,821 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:24:05,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:24:05,931 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:24:05,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:05,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:24:05,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:24:05,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-29 20:24:05,951 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:24:05,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:24:05,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:24:05,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-29 20:24:06,021 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:24:06,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:06,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:24:06,027 INFO L119 LiptonReduction]: Number of co-enabled transitions 3320 [2023-08-29 20:24:13,116 INFO L134 LiptonReduction]: Checked pairs total: 8867 [2023-08-29 20:24:13,116 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-29 20:24:13,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:24:13,134 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;@221fb97d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:24:13,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:24:13,136 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:24:13,137 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:13,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:13,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:24:13,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:13,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-08-29 20:24:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102728871] [2023-08-29 20:24:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:13,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:13,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:13,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:13,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:24:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:24:13,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:13,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:13,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102728871] [2023-08-29 20:24:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102728871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:13,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:13,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:24:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935587757] [2023-08-29 20:24:13,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:13,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:24:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:24:13,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:24:13,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 276 [2023-08-29 20:24:13,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:13,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:13,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 276 [2023-08-29 20:24:13,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:14,388 INFO L130 PetriNetUnfolder]: 5761/7953 cut-off events. [2023-08-29 20:24:14,389 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-29 20:24:14,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15943 conditions, 7953 events. 5761/7953 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 42017 event pairs, 5761 based on Foata normal form. 240/6872 useless extension candidates. Maximal degree in co-relation 15931. Up to 7833 conditions per place. [2023-08-29 20:24:14,432 INFO L137 encePairwiseOnDemand]: 267/276 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:24:14,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-29 20:24:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:24:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:24:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2023-08-29 20:24:14,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2023-08-29 20:24:14,449 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 292 transitions. [2023-08-29 20:24:14,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions. [2023-08-29 20:24:14,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:14,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions. [2023-08-29 20:24:14,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:14,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:14,468 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:14,469 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 292 transitions. [2023-08-29 20:24:14,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-29 20:24:14,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:24:14,478 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:24:14,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:24:14,484 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:24:14,484 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:24:14,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:14,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:14,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:14,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:14,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:14,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:14,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1162543712, now seen corresponding path program 1 times [2023-08-29 20:24:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516404936] [2023-08-29 20:24:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:14,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-29 20:24:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:14,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:14,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:24:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:14,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:24:14,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:14,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:14,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516404936] [2023-08-29 20:24:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516404936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:24:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363153597] [2023-08-29 20:24:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:14,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:24:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:14,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:24:14,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:24:14,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 276 [2023-08-29 20:24:14,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:14,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:14,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 276 [2023-08-29 20:24:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:15,598 INFO L130 PetriNetUnfolder]: 4535/6637 cut-off events. [2023-08-29 20:24:15,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:24:15,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12966 conditions, 6637 events. 4535/6637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 39367 event pairs, 857 based on Foata normal form. 0/5997 useless extension candidates. Maximal degree in co-relation 12963. Up to 4903 conditions per place. [2023-08-29 20:24:15,627 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 37 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2023-08-29 20:24:15,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 192 flow [2023-08-29 20:24:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:24:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:24:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:24:15,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132850241545893 [2023-08-29 20:24:15,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:24:15,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:24:15,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:15,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:24:15,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:15,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:15,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:15,634 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:24:15,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 192 flow [2023-08-29 20:24:15,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:24:15,636 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-08-29 20:24:15,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:24:15,637 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:24:15,637 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-08-29 20:24:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:15,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:15,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:15,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:15,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:15,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:15,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 763352159, now seen corresponding path program 1 times [2023-08-29 20:24:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999615315] [2023-08-29 20:24:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:15,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:15,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:15,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:24:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:15,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:24:15,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:15,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:15,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999615315] [2023-08-29 20:24:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999615315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:15,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:15,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:24:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7636821] [2023-08-29 20:24:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:15,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:24:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:15,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:24:15,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:24:16,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:24:16,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:16,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:16,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:24:16,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:16,411 INFO L130 PetriNetUnfolder]: 2335/3391 cut-off events. [2023-08-29 20:24:16,412 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2023-08-29 20:24:16,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7090 conditions, 3391 events. 2335/3391 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 17108 event pairs, 529 based on Foata normal form. 54/3277 useless extension candidates. Maximal degree in co-relation 7086. Up to 3074 conditions per place. [2023-08-29 20:24:16,437 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 36 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2023-08-29 20:24:16,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 194 flow [2023-08-29 20:24:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:24:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:24:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-29 20:24:16,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2023-08-29 20:24:16,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-29 20:24:16,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-29 20:24:16,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:16,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-29 20:24:16,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:16,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:16,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:16,444 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 3 states and 411 transitions. [2023-08-29 20:24:16,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 194 flow [2023-08-29 20:24:16,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:24:16,446 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 99 flow [2023-08-29 20:24:16,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-29 20:24:16,447 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:24:16,448 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 99 flow [2023-08-29 20:24:16,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:16,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:16,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:16,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:16,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:16,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:16,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1464677098, now seen corresponding path program 1 times [2023-08-29 20:24:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285977236] [2023-08-29 20:24:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:16,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:16,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:16,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:24:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:16,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:24:16,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:16,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:16,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285977236] [2023-08-29 20:24:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285977236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:24:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064896488] [2023-08-29 20:24:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:16,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:24:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:16,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:24:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:24:16,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:24:16,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:16,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:16,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:24:16,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:17,133 INFO L130 PetriNetUnfolder]: 1120/1777 cut-off events. [2023-08-29 20:24:17,134 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-08-29 20:24:17,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 1777 events. 1120/1777 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8733 event pairs, 230 based on Foata normal form. 81/1785 useless extension candidates. Maximal degree in co-relation 4311. Up to 1054 conditions per place. [2023-08-29 20:24:17,143 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 47 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2023-08-29 20:24:17,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 285 flow [2023-08-29 20:24:17,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:24:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:24:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-29 20:24:17,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49728260869565216 [2023-08-29 20:24:17,147 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-29 20:24:17,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-29 20:24:17,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:17,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-29 20:24:17,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,152 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 99 flow. Second operand 4 states and 549 transitions. [2023-08-29 20:24:17,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 285 flow [2023-08-29 20:24:17,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:24:17,154 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 146 flow [2023-08-29 20:24:17,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-29 20:24:17,155 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-08-29 20:24:17,155 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 146 flow [2023-08-29 20:24:17,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:17,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:17,171 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-29 20:24:17,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:17,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:17,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash -290876520, now seen corresponding path program 1 times [2023-08-29 20:24:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:17,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315064269] [2023-08-29 20:24:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:17,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:17,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:24:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:17,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:24:17,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:17,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:17,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315064269] [2023-08-29 20:24:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315064269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:17,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:24:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705708389] [2023-08-29 20:24:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:17,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:24:17,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:17,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:24:17,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:24:17,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:24:17,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:17,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:24:17,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:17,832 INFO L130 PetriNetUnfolder]: 670/1102 cut-off events. [2023-08-29 20:24:17,833 INFO L131 PetriNetUnfolder]: For 756/756 co-relation queries the response was YES. [2023-08-29 20:24:17,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 1102 events. 670/1102 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5048 event pairs, 169 based on Foata normal form. 45/1119 useless extension candidates. Maximal degree in co-relation 3079. Up to 400 conditions per place. [2023-08-29 20:24:17,841 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 56 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2023-08-29 20:24:17,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 386 flow [2023-08-29 20:24:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:24:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:24:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-08-29 20:24:17,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2023-08-29 20:24:17,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-08-29 20:24:17,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-08-29 20:24:17,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:17,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-08-29 20:24:17,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,851 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 146 flow. Second operand 5 states and 685 transitions. [2023-08-29 20:24:17,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 386 flow [2023-08-29 20:24:17,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 368 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:24:17,858 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 196 flow [2023-08-29 20:24:17,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-29 20:24:17,861 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-29 20:24:17,861 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 196 flow [2023-08-29 20:24:17,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:17,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:17,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:17,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:18,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:18,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:18,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1413672234, now seen corresponding path program 1 times [2023-08-29 20:24:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373674385] [2023-08-29 20:24:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:18,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:18,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:18,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:24:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:18,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:24:18,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:18,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:18,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:18,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373674385] [2023-08-29 20:24:18,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373674385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:18,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:18,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:24:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417001617] [2023-08-29 20:24:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:18,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:24:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:18,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:24:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:24:18,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:24:18,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:18,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:18,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:24:18,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:18,624 INFO L130 PetriNetUnfolder]: 615/992 cut-off events. [2023-08-29 20:24:18,624 INFO L131 PetriNetUnfolder]: For 873/873 co-relation queries the response was YES. [2023-08-29 20:24:18,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 992 events. 615/992 cut-off events. For 873/873 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4501 event pairs, 164 based on Foata normal form. 11/986 useless extension candidates. Maximal degree in co-relation 2889. Up to 400 conditions per place. [2023-08-29 20:24:18,631 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 52 selfloop transitions, 17 changer transitions 0/74 dead transitions. [2023-08-29 20:24:18,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 412 flow [2023-08-29 20:24:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:24:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:24:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-29 20:24:18,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48792270531400966 [2023-08-29 20:24:18,634 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-29 20:24:18,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-29 20:24:18,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:18,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-29 20:24:18,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:18,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:18,640 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:18,640 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 196 flow. Second operand 6 states and 808 transitions. [2023-08-29 20:24:18,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 412 flow [2023-08-29 20:24:18,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 378 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-29 20:24:18,650 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2023-08-29 20:24:18,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-29 20:24:18,650 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-29 20:24:18,651 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2023-08-29 20:24:18,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:18,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:18,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:18,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:18,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:18,862 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:18,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1280005922, now seen corresponding path program 1 times [2023-08-29 20:24:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:18,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186171941] [2023-08-29 20:24:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:18,865 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:18,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:24:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:18,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:24:18,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:19,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:19,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:19,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186171941] [2023-08-29 20:24:19,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186171941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:19,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:19,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:24:19,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711881026] [2023-08-29 20:24:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:19,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:24:19,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:19,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:24:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:24:19,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:24:19,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:19,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:19,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:24:19,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:19,453 INFO L130 PetriNetUnfolder]: 1121/1783 cut-off events. [2023-08-29 20:24:19,453 INFO L131 PetriNetUnfolder]: For 1873/1873 co-relation queries the response was YES. [2023-08-29 20:24:19,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 1783 events. 1121/1783 cut-off events. For 1873/1873 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8902 event pairs, 256 based on Foata normal form. 0/1774 useless extension candidates. Maximal degree in co-relation 5355. Up to 953 conditions per place. [2023-08-29 20:24:19,462 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 82 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2023-08-29 20:24:19,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 643 flow [2023-08-29 20:24:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:24:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:24:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-29 20:24:19,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486231884057971 [2023-08-29 20:24:19,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-29 20:24:19,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-29 20:24:19,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:19,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-29 20:24:19,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:19,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:19,469 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:19,469 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 5 states and 671 transitions. [2023-08-29 20:24:19,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 643 flow [2023-08-29 20:24:19,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 530 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-29 20:24:19,482 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 177 flow [2023-08-29 20:24:19,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-29 20:24:19,483 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-29 20:24:19,483 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 177 flow [2023-08-29 20:24:19,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:19,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:19,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:19,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:19,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:19,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:19,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash -613331492, now seen corresponding path program 2 times [2023-08-29 20:24:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791211052] [2023-08-29 20:24:19,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:24:19,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:19,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:19,696 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:19,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:24:19,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:24:19,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:24:19,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:24:19,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:20,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:20,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791211052] [2023-08-29 20:24:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791211052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:20,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:24:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932642208] [2023-08-29 20:24:20,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:24:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:24:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:24:20,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-29 20:24:20,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:20,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:20,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-29 20:24:20,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:20,634 INFO L130 PetriNetUnfolder]: 1426/2351 cut-off events. [2023-08-29 20:24:20,634 INFO L131 PetriNetUnfolder]: For 2068/2068 co-relation queries the response was YES. [2023-08-29 20:24:20,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6551 conditions, 2351 events. 1426/2351 cut-off events. For 2068/2068 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13300 event pairs, 536 based on Foata normal form. 1/2273 useless extension candidates. Maximal degree in co-relation 6540. Up to 1191 conditions per place. [2023-08-29 20:24:20,650 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 63 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-29 20:24:20,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 444 flow [2023-08-29 20:24:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:24:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:24:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-29 20:24:20,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48731884057971014 [2023-08-29 20:24:20,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-29 20:24:20,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-29 20:24:20,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:20,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-29 20:24:20,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:20,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:20,656 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:20,656 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 177 flow. Second operand 4 states and 538 transitions. [2023-08-29 20:24:20,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 444 flow [2023-08-29 20:24:20,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:24:20,674 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 210 flow [2023-08-29 20:24:20,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-29 20:24:20,675 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-29 20:24:20,675 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 210 flow [2023-08-29 20:24:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:20,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:20,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:20,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:20,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:20,886 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:20,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2088449350, now seen corresponding path program 1 times [2023-08-29 20:24:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282026103] [2023-08-29 20:24:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:24:20,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:20,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:20,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:20,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:24:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:24:21,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:24:21,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:21,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:21,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:21,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282026103] [2023-08-29 20:24:21,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282026103] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:21,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:21,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:24:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772524331] [2023-08-29 20:24:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:21,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:24:21,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:21,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:24:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:24:21,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2023-08-29 20:24:21,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:21,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:21,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2023-08-29 20:24:21,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:22,409 INFO L130 PetriNetUnfolder]: 1204/2076 cut-off events. [2023-08-29 20:24:22,410 INFO L131 PetriNetUnfolder]: For 1676/1676 co-relation queries the response was YES. [2023-08-29 20:24:22,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5889 conditions, 2076 events. 1204/2076 cut-off events. For 1676/1676 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12357 event pairs, 58 based on Foata normal form. 4/2027 useless extension candidates. Maximal degree in co-relation 5876. Up to 1602 conditions per place. [2023-08-29 20:24:22,421 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 54 selfloop transitions, 4 changer transitions 5/68 dead transitions. [2023-08-29 20:24:22,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 438 flow [2023-08-29 20:24:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:24:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:24:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-29 20:24:22,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148550724637681 [2023-08-29 20:24:22,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-29 20:24:22,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-29 20:24:22,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:22,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-29 20:24:22,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 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-29 20:24:22,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:22,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:22,431 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 210 flow. Second operand 6 states and 687 transitions. [2023-08-29 20:24:22,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 438 flow [2023-08-29 20:24:22,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:24:22,447 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 178 flow [2023-08-29 20:24:22,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-08-29 20:24:22,448 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-29 20:24:22,448 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 178 flow [2023-08-29 20:24:22,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:22,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:22,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:22,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:24:22,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:22,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:22,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1175015090, now seen corresponding path program 3 times [2023-08-29 20:24:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135839955] [2023-08-29 20:24:22,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:24:22,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:22,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:22,663 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-29 20:24:22,666 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-29 20:24:22,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:24:22,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:24:22,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:24:22,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:24:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:24:22,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:24:22,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:24:22,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135839955] [2023-08-29 20:24:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135839955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:24:22,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:24:22,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:24:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909293928] [2023-08-29 20:24:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:24:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:24:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:24:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:24:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:24:22,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:24:22,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:22,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:24:22,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:24:22,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:24:23,142 INFO L130 PetriNetUnfolder]: 870/1423 cut-off events. [2023-08-29 20:24:23,142 INFO L131 PetriNetUnfolder]: For 1139/1139 co-relation queries the response was YES. [2023-08-29 20:24:23,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 1423 events. 870/1423 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6780 event pairs, 254 based on Foata normal form. 1/1394 useless extension candidates. Maximal degree in co-relation 4211. Up to 850 conditions per place. [2023-08-29 20:24:23,147 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 41 selfloop transitions, 1 changer transitions 39/85 dead transitions. [2023-08-29 20:24:23,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 552 flow [2023-08-29 20:24:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:24:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:24:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-29 20:24:23,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-29 20:24:23,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-29 20:24:23,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-29 20:24:23,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:24:23,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-29 20:24:23,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:23,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:23,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:23,154 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 178 flow. Second operand 5 states and 667 transitions. [2023-08-29 20:24:23,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 552 flow [2023-08-29 20:24:23,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 525 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-29 20:24:23,165 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 170 flow [2023-08-29 20:24:23,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-08-29 20:24:23,166 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-29 20:24:23,167 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 170 flow [2023-08-29 20:24:23,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:24:23,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:24:23,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:23,177 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-29 20:24:23,377 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-29 20:24:23,377 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:24:23,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:24:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1506331424, now seen corresponding path program 4 times [2023-08-29 20:24:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:24:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297623987] [2023-08-29 20:24:23,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:24:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:24:23,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:24:23,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:24:23,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:24:23,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:24:23,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:24:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:24:23,637 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:24:23,637 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:24:23,638 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:24:23,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:24:23,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:24:23,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:24:23,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:24:23,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:24:23,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:24:23,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:24:23,654 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 (12)] Ended with exit code 0 [2023-08-29 20:24:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:24:23,852 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:24:23,857 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:24:23,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:24:23,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:24:23 BasicIcfg [2023-08-29 20:24:23,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:24:23,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:24:23,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:24:23,935 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:24:23,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:24:05" (3/4) ... [2023-08-29 20:24:23,940 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:24:23,940 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:24:23,941 INFO L158 Benchmark]: Toolchain (without parser) took 19667.86ms. Allocated memory was 83.9MB in the beginning and 861.9MB in the end (delta: 778.0MB). Free memory was 62.1MB in the beginning and 647.3MB in the end (delta: -585.2MB). Peak memory consumption was 194.5MB. Max. memory is 16.1GB. [2023-08-29 20:24:23,941 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:24:23,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.23ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 57.5MB in the end (delta: 4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-08-29 20:24:23,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.85ms. Allocated memory is still 83.9MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:23,942 INFO L158 Benchmark]: Boogie Preprocessor took 52.49ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 52.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:24:23,942 INFO L158 Benchmark]: RCFGBuilder took 783.62ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 34.3MB in the end (delta: 17.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-08-29 20:24:23,942 INFO L158 Benchmark]: TraceAbstraction took 18212.64ms. Allocated memory was 83.9MB in the beginning and 861.9MB in the end (delta: 778.0MB). Free memory was 33.5MB in the beginning and 647.3MB in the end (delta: -613.7MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2023-08-29 20:24:23,942 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 861.9MB. Free memory is still 647.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:24:23,944 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.23ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 57.5MB in the end (delta: 4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.85ms. Allocated memory is still 83.9MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.49ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 52.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 783.62ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 34.3MB in the end (delta: 17.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18212.64ms. Allocated memory was 83.9MB in the beginning and 861.9MB in the end (delta: 778.0MB). Free memory was 33.5MB in the beginning and 647.3MB in the end (delta: -613.7MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 861.9MB. Free memory is still 647.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 149 PlacesBefore, 53 PlacesAfterwards, 138 TransitionsBefore, 41 TransitionsAfterwards, 3320 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 134 TotalNumberOfCompositions, 8867 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4144, independent: 3938, independent conditional: 0, independent unconditional: 3938, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1743, independent: 1713, independent conditional: 0, independent unconditional: 1713, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4144, independent: 2225, independent conditional: 0, independent unconditional: 2225, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 1743, unknown conditional: 0, unknown unconditional: 1743] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-1, t773={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=0, t773={11:0}, t774={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=1, t773={11:0}, t774={15:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=2, t773={11:0}, t774={15:0}, t775={7:0}, t776={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={11:0}, t774={15:0}, t775={7:0}, t776={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1485 IncrementalHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 15 mSDtfsCounter, 1485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 179 ConstructedInterpolants, 15 QuantifiedInterpolants, 1500 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1527 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:24:23,971 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